./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:43:56,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:43:56,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:43:56,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:43:56,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:43:56,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:43:56,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:43:56,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:43:56,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:43:56,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:43:56,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:43:56,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:43:56,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:43:56,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:43:56,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:43:56,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:43:56,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:43:56,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:43:56,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:43:56,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:43:56,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:43:56,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:43:56,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:43:56,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:43:56,960 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:43:56,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:43:56,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:43:56,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:43:56,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:43:56,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:43:56,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:43:56,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:43:56,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:43:56,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:43:56,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:43:56,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:43:56,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:43:56,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:43:56,965 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:43:56,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:43:56,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:43:56,966 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/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_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 [2023-11-26 10:43:57,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:43:57,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:43:57,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:43:57,271 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:43:57,272 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:43:57,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2023-11-26 10:44:00,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:44:00,737 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:44:00,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2023-11-26 10:44:00,755 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/data/a11794ba2/fdb87ae416914b5eb431e5b48082b502/FLAG41ae1dbe0 [2023-11-26 10:44:00,770 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/data/a11794ba2/fdb87ae416914b5eb431e5b48082b502 [2023-11-26 10:44:00,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:44:00,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:44:00,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:44:00,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:44:00,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:44:00,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:44:00" (1/1) ... [2023-11-26 10:44:00,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@578eba1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:00, skipping insertion in model container [2023-11-26 10:44:00,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:44:00" (1/1) ... [2023-11-26 10:44:00,837 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:44:01,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:44:01,267 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:44:01,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:44:01,401 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:44:01,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01 WrapperNode [2023-11-26 10:44:01,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:44:01,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:44:01,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:44:01,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:44:01,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,480 INFO L138 Inliner]: procedures = 169, calls = 20, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 186 [2023-11-26 10:44:01,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:44:01,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:44:01,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:44:01,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:44:01,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:44:01,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:44:01,536 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:44:01,536 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:44:01,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (1/1) ... [2023-11-26 10:44:01,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:44:01,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:44:01,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:44:01,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b9ee502-cb59-48fa-b15a-4be22b0c3411/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:44:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:44:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 10:44:01,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 10:44:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:44:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:44:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:44:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:44:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:44:01,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:44:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:44:01,649 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:44:01,855 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:44:01,857 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:44:02,227 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:44:02,405 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:44:02,408 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-26 10:44:02,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:44:02 BoogieIcfgContainer [2023-11-26 10:44:02,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:44:02,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:44:02,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:44:02,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:44:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:44:00" (1/3) ... [2023-11-26 10:44:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dee42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:44:02, skipping insertion in model container [2023-11-26 10:44:02,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:01" (2/3) ... [2023-11-26 10:44:02,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627dee42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:44:02, skipping insertion in model container [2023-11-26 10:44:02,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:44:02" (3/3) ... [2023-11-26 10:44:02,424 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-b.i [2023-11-26 10:44:02,434 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:44:02,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:44:02,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-26 10:44:02,446 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:44:02,534 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:44:02,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 162 transitions, 328 flow [2023-11-26 10:44:02,669 INFO L124 PetriNetUnfolderBase]: 14/246 cut-off events. [2023-11-26 10:44:02,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:44:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 246 events. 14/246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 817 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 148. Up to 4 conditions per place. [2023-11-26 10:44:02,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 162 transitions, 328 flow [2023-11-26 10:44:02,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 162 transitions, 328 flow [2023-11-26 10:44:02,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:44:02,701 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@335c9283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:44:02,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-11-26 10:44:02,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:44:02,709 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-26 10:44:02,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:44:02,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:02,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:02,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-26 10:44:02,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1371706857, now seen corresponding path program 1 times [2023-11-26 10:44:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:02,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815420092] [2023-11-26 10:44:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815420092] [2023-11-26 10:44:02,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815420092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812020256] [2023-11-26 10:44:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:44:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:44:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:44:02,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 162 [2023-11-26 10:44:02,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 162 transitions, 328 flow. Second operand has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:02,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:02,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 162 [2023-11-26 10:44:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:03,141 INFO L124 PetriNetUnfolderBase]: 5/261 cut-off events. [2023-11-26 10:44:03,141 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:44:03,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 261 events. 5/261 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 785 event pairs, 1 based on Foata normal form. 16/238 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2023-11-26 10:44:03,150 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 3 selfloop transitions, 0 changer transitions 0/139 dead transitions. [2023-11-26 10:44:03,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 288 flow [2023-11-26 10:44:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:44:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:44:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-11-26 10:44:03,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2023-11-26 10:44:03,174 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-11-26 10:44:03,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-11-26 10:44:03,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:03,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-11-26 10:44:03,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:03,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:03,194 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:03,197 INFO L175 Difference]: Start difference. First operand has 156 places, 162 transitions, 328 flow. Second operand 2 states and 300 transitions. [2023-11-26 10:44:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 288 flow [2023-11-26 10:44:03,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 288 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:03,208 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 282 flow [2023-11-26 10:44:03,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=282, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2023-11-26 10:44:03,217 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -15 predicate places. [2023-11-26 10:44:03,218 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 282 flow [2023-11-26 10:44:03,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:03,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:03,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:03,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:44:03,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-26 10:44:03,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1292326996, now seen corresponding path program 1 times [2023-11-26 10:44:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417440181] [2023-11-26 10:44:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417440181] [2023-11-26 10:44:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417440181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:03,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:03,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611476785] [2023-11-26 10:44:03,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:04,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:04,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 162 [2023-11-26 10:44:04,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:04,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 162 [2023-11-26 10:44:04,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:04,377 INFO L124 PetriNetUnfolderBase]: 28/773 cut-off events. [2023-11-26 10:44:04,378 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:44:04,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 773 events. 28/773 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4329 event pairs, 5 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 839. Up to 36 conditions per place. [2023-11-26 10:44:04,384 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 16 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2023-11-26 10:44:04,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 152 transitions, 360 flow [2023-11-26 10:44:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:44:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 807 transitions. [2023-11-26 10:44:04,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8302469135802469 [2023-11-26 10:44:04,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 807 transitions. [2023-11-26 10:44:04,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 807 transitions. [2023-11-26 10:44:04,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:04,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 807 transitions. [2023-11-26 10:44:04,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,402 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,403 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 282 flow. Second operand 6 states and 807 transitions. [2023-11-26 10:44:04,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 152 transitions, 360 flow [2023-11-26 10:44:04,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 152 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:04,411 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 358 flow [2023-11-26 10:44:04,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2023-11-26 10:44:04,414 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, -5 predicate places. [2023-11-26 10:44:04,414 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 358 flow [2023-11-26 10:44:04,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:04,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:04,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:44:04,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-26 10:44:04,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -367454083, now seen corresponding path program 1 times [2023-11-26 10:44:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157868694] [2023-11-26 10:44:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:04,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:04,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157868694] [2023-11-26 10:44:04,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157868694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:04,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:04,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882244684] [2023-11-26 10:44:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:04,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:04,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 162 [2023-11-26 10:44:04,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:04,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:04,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 162 [2023-11-26 10:44:04,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:05,138 INFO L124 PetriNetUnfolderBase]: 35/934 cut-off events. [2023-11-26 10:44:05,138 INFO L125 PetriNetUnfolderBase]: For 37/44 co-relation queries the response was YES. [2023-11-26 10:44:05,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 934 events. 35/934 cut-off events. For 37/44 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6446 event pairs, 4 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 1182. Up to 43 conditions per place. [2023-11-26 10:44:05,148 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 18 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2023-11-26 10:44:05,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 162 transitions, 440 flow [2023-11-26 10:44:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:44:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-11-26 10:44:05,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8405349794238683 [2023-11-26 10:44:05,152 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-11-26 10:44:05,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-11-26 10:44:05,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:05,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-11-26 10:44:05,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,160 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 358 flow. Second operand 6 states and 817 transitions. [2023-11-26 10:44:05,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 162 transitions, 440 flow [2023-11-26 10:44:05,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:05,168 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 434 flow [2023-11-26 10:44:05,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2023-11-26 10:44:05,170 INFO L281 CegarLoopForPetriNet]: 156 programPoint places, 5 predicate places. [2023-11-26 10:44:05,170 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 434 flow [2023-11-26 10:44:05,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:05,172 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:05,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:44:05,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2023-11-26 10:44:05,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash -434858555, now seen corresponding path program 1 times [2023-11-26 10:44:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606481814] [2023-11-26 10:44:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:44:05,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:44:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:44:05,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:44:05,220 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:44:05,221 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2023-11-26 10:44:05,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2023-11-26 10:44:05,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2023-11-26 10:44:05,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2023-11-26 10:44:05,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2023-11-26 10:44:05,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2023-11-26 10:44:05,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2023-11-26 10:44:05,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2023-11-26 10:44:05,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2023-11-26 10:44:05,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2023-11-26 10:44:05,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2023-11-26 10:44:05,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2023-11-26 10:44:05,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2023-11-26 10:44:05,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2023-11-26 10:44:05,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2023-11-26 10:44:05,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2023-11-26 10:44:05,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2023-11-26 10:44:05,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2023-11-26 10:44:05,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2023-11-26 10:44:05,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2023-11-26 10:44:05,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2023-11-26 10:44:05,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2023-11-26 10:44:05,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2023-11-26 10:44:05,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2023-11-26 10:44:05,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2023-11-26 10:44:05,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2023-11-26 10:44:05,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2023-11-26 10:44:05,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2023-11-26 10:44:05,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2023-11-26 10:44:05,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2023-11-26 10:44:05,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2023-11-26 10:44:05,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2023-11-26 10:44:05,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2023-11-26 10:44:05,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2023-11-26 10:44:05,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2023-11-26 10:44:05,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2023-11-26 10:44:05,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2023-11-26 10:44:05,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:44:05,234 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 10:44:05,237 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:44:05,237 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:44:05,287 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:44:05,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 225 transitions, 460 flow [2023-11-26 10:44:05,359 INFO L124 PetriNetUnfolderBase]: 23/395 cut-off events. [2023-11-26 10:44:05,359 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 10:44:05,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 395 events. 23/395 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1720 event pairs, 0 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 247. Up to 6 conditions per place. [2023-11-26 10:44:05,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 225 transitions, 460 flow [2023-11-26 10:44:05,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 225 transitions, 460 flow [2023-11-26 10:44:05,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:44:05,372 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@335c9283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:44:05,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2023-11-26 10:44:05,376 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:44:05,376 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-11-26 10:44:05,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:44:05,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:05,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:05,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:05,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash 453008810, now seen corresponding path program 1 times [2023-11-26 10:44:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098390991] [2023-11-26 10:44:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:05,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098390991] [2023-11-26 10:44:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098390991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:05,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:05,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658493461] [2023-11-26 10:44:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:05,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:44:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:44:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:44:05,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 225 [2023-11-26 10:44:05,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 225 transitions, 460 flow. Second operand has 2 states, 2 states have (on average 193.0) internal successors, (386), 2 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:05,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 225 [2023-11-26 10:44:05,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:05,544 INFO L124 PetriNetUnfolderBase]: 18/638 cut-off events. [2023-11-26 10:44:05,544 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 10:44:05,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 638 events. 18/638 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3560 event pairs, 7 based on Foata normal form. 46/577 useless extension candidates. Maximal degree in co-relation 389. Up to 21 conditions per place. [2023-11-26 10:44:05,552 INFO L140 encePairwiseOnDemand]: 200/225 looper letters, 5 selfloop transitions, 0 changer transitions 0/191 dead transitions. [2023-11-26 10:44:05,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 402 flow [2023-11-26 10:44:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:44:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:44:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 414 transitions. [2023-11-26 10:44:05,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.92 [2023-11-26 10:44:05,555 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 414 transitions. [2023-11-26 10:44:05,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 414 transitions. [2023-11-26 10:44:05,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:05,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 414 transitions. [2023-11-26 10:44:05,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 207.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,559 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,559 INFO L175 Difference]: Start difference. First operand has 217 places, 225 transitions, 460 flow. Second operand 2 states and 414 transitions. [2023-11-26 10:44:05,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 402 flow [2023-11-26 10:44:05,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 191 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:05,565 INFO L231 Difference]: Finished difference. Result has 194 places, 191 transitions, 392 flow [2023-11-26 10:44:05,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=392, PETRI_PLACES=194, PETRI_TRANSITIONS=191} [2023-11-26 10:44:05,566 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -23 predicate places. [2023-11-26 10:44:05,566 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 191 transitions, 392 flow [2023-11-26 10:44:05,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 193.0) internal successors, (386), 2 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:05,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:44:05,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:05,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2099344876, now seen corresponding path program 1 times [2023-11-26 10:44:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814215686] [2023-11-26 10:44:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:05,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814215686] [2023-11-26 10:44:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814215686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437496204] [2023-11-26 10:44:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:05,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:05,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 225 [2023-11-26 10:44:05,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 191 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:05,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:05,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 225 [2023-11-26 10:44:05,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:06,533 INFO L124 PetriNetUnfolderBase]: 134/2690 cut-off events. [2023-11-26 10:44:06,533 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-26 10:44:06,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 2690 events. 134/2690 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 24145 event pairs, 33 based on Foata normal form. 0/2223 useless extension candidates. Maximal degree in co-relation 2909. Up to 141 conditions per place. [2023-11-26 10:44:06,568 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 18 selfloop transitions, 14 changer transitions 0/208 dead transitions. [2023-11-26 10:44:06,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 208 transitions, 490 flow [2023-11-26 10:44:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:44:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1125 transitions. [2023-11-26 10:44:06,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-26 10:44:06,573 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1125 transitions. [2023-11-26 10:44:06,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1125 transitions. [2023-11-26 10:44:06,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:06,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1125 transitions. [2023-11-26 10:44:06,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.5) internal successors, (1125), 6 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) [2023-11-26 10:44:06,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:06,584 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:06,584 INFO L175 Difference]: Start difference. First operand has 194 places, 191 transitions, 392 flow. Second operand 6 states and 1125 transitions. [2023-11-26 10:44:06,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 208 transitions, 490 flow [2023-11-26 10:44:06,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 208 transitions, 490 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:06,591 INFO L231 Difference]: Finished difference. Result has 204 places, 205 transitions, 494 flow [2023-11-26 10:44:06,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=204, PETRI_TRANSITIONS=205} [2023-11-26 10:44:06,594 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -13 predicate places. [2023-11-26 10:44:06,594 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 205 transitions, 494 flow [2023-11-26 10:44:06,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:06,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:06,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:06,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:44:06,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:06,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash -417143202, now seen corresponding path program 1 times [2023-11-26 10:44:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076302109] [2023-11-26 10:44:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076302109] [2023-11-26 10:44:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076302109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963920255] [2023-11-26 10:44:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:06,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:06,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:07,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2023-11-26 10:44:07,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:07,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:07,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2023-11-26 10:44:07,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:08,343 INFO L124 PetriNetUnfolderBase]: 414/5300 cut-off events. [2023-11-26 10:44:08,343 INFO L125 PetriNetUnfolderBase]: For 562/604 co-relation queries the response was YES. [2023-11-26 10:44:08,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6737 conditions, 5300 events. 414/5300 cut-off events. For 562/604 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 58677 event pairs, 54 based on Foata normal form. 0/4437 useless extension candidates. Maximal degree in co-relation 6727. Up to 366 conditions per place. [2023-11-26 10:44:08,417 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 28 selfloop transitions, 30 changer transitions 0/242 dead transitions. [2023-11-26 10:44:08,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 242 transitions, 776 flow [2023-11-26 10:44:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:44:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1139 transitions. [2023-11-26 10:44:08,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8437037037037037 [2023-11-26 10:44:08,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1139 transitions. [2023-11-26 10:44:08,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1139 transitions. [2023-11-26 10:44:08,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:08,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1139 transitions. [2023-11-26 10:44:08,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:08,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:08,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:08,431 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 494 flow. Second operand 6 states and 1139 transitions. [2023-11-26 10:44:08,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 242 transitions, 776 flow [2023-11-26 10:44:08,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 242 transitions, 776 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:08,444 INFO L231 Difference]: Finished difference. Result has 214 places, 235 transitions, 772 flow [2023-11-26 10:44:08,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=214, PETRI_TRANSITIONS=235} [2023-11-26 10:44:08,448 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, -3 predicate places. [2023-11-26 10:44:08,448 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 235 transitions, 772 flow [2023-11-26 10:44:08,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.33333333333334) internal successors, (1112), 6 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:08,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:08,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:08,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:44:08,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1164224104, now seen corresponding path program 1 times [2023-11-26 10:44:08,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:08,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069258104] [2023-11-26 10:44:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:08,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:08,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069258104] [2023-11-26 10:44:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069258104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753947911] [2023-11-26 10:44:08,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:08,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:08,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:08,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:08,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 225 [2023-11-26 10:44:08,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 235 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:08,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:08,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 225 [2023-11-26 10:44:08,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:14,659 INFO L124 PetriNetUnfolderBase]: 4608/30686 cut-off events. [2023-11-26 10:44:14,660 INFO L125 PetriNetUnfolderBase]: For 5513/5743 co-relation queries the response was YES. [2023-11-26 10:44:14,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43522 conditions, 30686 events. 4608/30686 cut-off events. For 5513/5743 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 439442 event pairs, 1493 based on Foata normal form. 10/26308 useless extension candidates. Maximal degree in co-relation 43507. Up to 5422 conditions per place. [2023-11-26 10:44:14,946 INFO L140 encePairwiseOnDemand]: 204/225 looper letters, 94 selfloop transitions, 15 changer transitions 0/286 dead transitions. [2023-11-26 10:44:14,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 286 transitions, 1313 flow [2023-11-26 10:44:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:44:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:44:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-26 10:44:14,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8355555555555556 [2023-11-26 10:44:14,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-26 10:44:14,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-26 10:44:14,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:14,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-26 10:44:14,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:14,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:14,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:14,955 INFO L175 Difference]: Start difference. First operand has 214 places, 235 transitions, 772 flow. Second operand 3 states and 564 transitions. [2023-11-26 10:44:14,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 286 transitions, 1313 flow [2023-11-26 10:44:14,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 286 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:44:14,982 INFO L231 Difference]: Finished difference. Result has 218 places, 250 transitions, 904 flow [2023-11-26 10:44:14,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=218, PETRI_TRANSITIONS=250} [2023-11-26 10:44:14,983 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 1 predicate places. [2023-11-26 10:44:14,983 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 250 transitions, 904 flow [2023-11-26 10:44:14,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:14,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:14,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:44:14,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:14,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1354795915, now seen corresponding path program 1 times [2023-11-26 10:44:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217334080] [2023-11-26 10:44:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:14,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217334080] [2023-11-26 10:44:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217334080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448479195] [2023-11-26 10:44:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:15,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 225 [2023-11-26 10:44:15,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 250 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:15,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:15,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 225 [2023-11-26 10:44:15,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:21,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][48], [220#true, 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, 208#L703-6true, Black: 235#true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), 156#L703-6true, Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 249#(= |#race~s~0| 0), thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:21,888 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-26 10:44:21,888 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 10:44:21,888 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 10:44:21,888 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 10:44:23,108 INFO L124 PetriNetUnfolderBase]: 8962/52610 cut-off events. [2023-11-26 10:44:23,108 INFO L125 PetriNetUnfolderBase]: For 8239/8659 co-relation queries the response was YES. [2023-11-26 10:44:23,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79931 conditions, 52610 events. 8962/52610 cut-off events. For 8239/8659 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 807630 event pairs, 4155 based on Foata normal form. 0/45060 useless extension candidates. Maximal degree in co-relation 79914. Up to 7173 conditions per place. [2023-11-26 10:44:23,618 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 63 selfloop transitions, 9 changer transitions 0/270 dead transitions. [2023-11-26 10:44:23,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 270 transitions, 1160 flow [2023-11-26 10:44:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:44:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:44:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-11-26 10:44:23,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8325925925925926 [2023-11-26 10:44:23,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-11-26 10:44:23,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-11-26 10:44:23,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:23,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-11-26 10:44:23,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:23,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:23,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:23,626 INFO L175 Difference]: Start difference. First operand has 218 places, 250 transitions, 904 flow. Second operand 3 states and 562 transitions. [2023-11-26 10:44:23,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 270 transitions, 1160 flow [2023-11-26 10:44:23,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 270 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:44:23,771 INFO L231 Difference]: Finished difference. Result has 220 places, 258 transitions, 944 flow [2023-11-26 10:44:23,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=944, PETRI_PLACES=220, PETRI_TRANSITIONS=258} [2023-11-26 10:44:23,774 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 3 predicate places. [2023-11-26 10:44:23,774 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 258 transitions, 944 flow [2023-11-26 10:44:23,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:23,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:23,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:23,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:44:23,777 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:23,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -489276758, now seen corresponding path program 1 times [2023-11-26 10:44:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410225241] [2023-11-26 10:44:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:23,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410225241] [2023-11-26 10:44:23,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410225241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:23,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002921209] [2023-11-26 10:44:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:23,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:23,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 225 [2023-11-26 10:44:23,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 258 transitions, 944 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:23,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:23,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 225 [2023-11-26 10:44:23,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:26,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][267], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, 98#L702-3true, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 121#L702-3true]) [2023-11-26 10:44:26,170 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 10:44:26,170 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:44:26,170 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:44:26,170 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:44:27,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][249], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 92#L702-4true, 121#L702-3true]) [2023-11-26 10:44:27,068 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:44:27,068 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:44:27,068 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:44:27,068 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:44:27,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([774] L702-1-->L702-2: Formula: (= |v_#race~c~0_1| |v_thr1Thread2of2ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread2of2ForFork0_#t~nondet6#1=|v_thr1Thread2of2ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~c~0][205], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 41#L702-4true, 190#L702-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 223#true, 259#true, 253#true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 98#L702-3true, thr1Thread2of2ForFork0InUse, Black: 247#true, 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2023-11-26 10:44:27,192 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is not cut-off event [2023-11-26 10:44:27,193 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 10:44:27,193 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 10:44:27,193 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-26 10:44:30,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][48], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, 208#L703-6true, Black: 235#true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), 156#L703-6true, Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:30,813 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-26 10:44:30,813 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 10:44:30,813 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 10:44:30,814 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 10:44:31,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([843] L701-8-->L701-9: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][109], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 73#L703-2true, Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 213#L701-9true, 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 253#true, Black: 235#true, 156#L703-6true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:31,285 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-26 10:44:31,285 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-26 10:44:31,285 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 10:44:31,285 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 10:44:32,191 INFO L124 PetriNetUnfolderBase]: 9994/56513 cut-off events. [2023-11-26 10:44:32,191 INFO L125 PetriNetUnfolderBase]: For 11427/13238 co-relation queries the response was YES. [2023-11-26 10:44:32,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89938 conditions, 56513 events. 9994/56513 cut-off events. For 11427/13238 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 877216 event pairs, 3855 based on Foata normal form. 3/48104 useless extension candidates. Maximal degree in co-relation 89920. Up to 7490 conditions per place. [2023-11-26 10:44:32,672 INFO L140 encePairwiseOnDemand]: 215/225 looper letters, 67 selfloop transitions, 13 changer transitions 0/282 dead transitions. [2023-11-26 10:44:32,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 282 transitions, 1251 flow [2023-11-26 10:44:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:44:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:44:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-26 10:44:32,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.84 [2023-11-26 10:44:32,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-26 10:44:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-26 10:44:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-26 10:44:32,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:32,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:32,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 225.0) internal successors, (900), 4 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:32,682 INFO L175 Difference]: Start difference. First operand has 220 places, 258 transitions, 944 flow. Second operand 3 states and 567 transitions. [2023-11-26 10:44:32,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 282 transitions, 1251 flow [2023-11-26 10:44:32,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 282 transitions, 1225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:44:32,911 INFO L231 Difference]: Finished difference. Result has 222 places, 269 transitions, 1038 flow [2023-11-26 10:44:32,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=222, PETRI_TRANSITIONS=269} [2023-11-26 10:44:32,913 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 5 predicate places. [2023-11-26 10:44:32,913 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 269 transitions, 1038 flow [2023-11-26 10:44:32,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:32,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:32,914 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:44:32,915 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:32,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash 157972193, now seen corresponding path program 1 times [2023-11-26 10:44:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363266599] [2023-11-26 10:44:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-26 10:44:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363266599] [2023-11-26 10:44:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363266599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815994717] [2023-11-26 10:44:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:33,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:33,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:33,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:33,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2023-11-26 10:44:33,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 269 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:33,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:33,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2023-11-26 10:44:33,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:44:34,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 124#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, 64#L701-4true, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:34,703 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:44:34,703 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:44:34,704 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:44:34,704 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:44:34,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:34,743 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-26 10:44:34,743 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,744 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,744 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,816 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:34,816 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is not cut-off event [2023-11-26 10:44:34,816 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-26 10:44:34,816 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-26 10:44:34,816 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-11-26 10:44:34,816 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is not cut-off event [2023-11-26 10:44:34,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 69#L701-4true, 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:34,945 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-26 10:44:34,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:44:34,945 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-26 10:44:34,945 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][215], [220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), 124#L701-8true, Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 247#true, 223#true]) [2023-11-26 10:44:34,946 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 10:44:34,946 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2023-11-26 10:44:37,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L700-1-->L701-14: Formula: (let ((.cse1 (select |v_#race_181| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|))) (let ((.cse2 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 3)) (.cse4 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse1 |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|)) (.cse3 (+ |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| 1))) (and (not (= (ite (not (= 4294967295 (mod v_~t~0_171 4294967296))) 1 0) 0)) (= .cse0 (select .cse1 .cse2)) (= |v_#race_181| (store |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_182| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= (store |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_136| |v_thr1Thread2of2ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of2ForFork0_~#l~0#1.offset_5| v_~t~0_171)) |v_#memory_int_135|) (= .cse0 (select .cse1 .cse4)) (= .cse0 (select .cse1 .cse3)) (= v_~t~0_170 (+ v_~t~0_171 1))))) InVars {#race=|v_#race_182|, #memory_int=|v_#memory_int_136|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_171} OutVars{#race=|v_#race_181|, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of2ForFork0_~#l~0#1.base=|v_thr1Thread2of2ForFork0_~#l~0#1.base_5|, thr1Thread2of2ForFork0_~#l~0#1.offset=|v_thr1Thread2of2ForFork0_~#l~0#1.offset_5|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, #memory_int=|v_#memory_int_135|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, #race~t~0=|v_#race~t~0_261|, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, ~t~0=v_~t~0_170} AuxVars[] AssignedVars[#race, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, #memory_int, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, #race~t~0, thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, ~t~0][118], [30#thr1_returnLabel#1true, 220#true, Black: 255#(= |ULTIMATE.start_thr1_#t~nondet6#1| |#race~c~0|), 235#true, 170#L701-14true, Black: 225#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 227#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 226#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 261#(= |thr1Thread1of2ForFork0_#t~nondet6#1| |#race~c~0|), 259#true, Black: 228#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 265#true, 17#L701-8true, Black: 240#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 238#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0)), Black: 239#(and (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ |thr1Thread1of2ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of2ForFork0_~#l~0#1.offset|)) 0)), Black: 237#(= (select (select |#race| |thr1Thread1of2ForFork0_~#l~0#1.base|) |thr1Thread1of2ForFork0_~#l~0#1.offset|) 0), thr1Thread1of2ForFork0InUse, thr1Thread2of2ForFork0InUse, Black: 249#(= |#race~s~0| 0), 223#true]) [2023-11-26 10:44:37,917 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:44:37,917 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:44:37,917 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:44:37,917 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:44:46,298 INFO L124 PetriNetUnfolderBase]: 16382/93733 cut-off events. [2023-11-26 10:44:46,298 INFO L125 PetriNetUnfolderBase]: For 14767/16887 co-relation queries the response was YES. [2023-11-26 10:44:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148814 conditions, 93733 events. 16382/93733 cut-off events. For 14767/16887 co-relation queries the response was YES. Maximal size of possible extension queue 2403. Compared 1575209 event pairs, 5727 based on Foata normal form. 12/80060 useless extension candidates. Maximal degree in co-relation 148795. Up to 12263 conditions per place. [2023-11-26 10:44:47,154 INFO L140 encePairwiseOnDemand]: 216/225 looper letters, 48 selfloop transitions, 46 changer transitions 0/318 dead transitions. [2023-11-26 10:44:47,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 318 transitions, 1468 flow [2023-11-26 10:44:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:44:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:44:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1135 transitions. [2023-11-26 10:44:47,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2023-11-26 10:44:47,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1135 transitions. [2023-11-26 10:44:47,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1135 transitions. [2023-11-26 10:44:47,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:44:47,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1135 transitions. [2023-11-26 10:44:47,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:47,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:47,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 225.0) internal successors, (1575), 7 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:47,169 INFO L175 Difference]: Start difference. First operand has 222 places, 269 transitions, 1038 flow. Second operand 6 states and 1135 transitions. [2023-11-26 10:44:47,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 318 transitions, 1468 flow [2023-11-26 10:44:47,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 318 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:44:47,700 INFO L231 Difference]: Finished difference. Result has 230 places, 315 transitions, 1466 flow [2023-11-26 10:44:47,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=230, PETRI_TRANSITIONS=315} [2023-11-26 10:44:47,701 INFO L281 CegarLoopForPetriNet]: 217 programPoint places, 13 predicate places. [2023-11-26 10:44:47,701 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 315 transitions, 1466 flow [2023-11-26 10:44:47,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.5) internal successors, (1113), 6 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:47,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:44:47,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:44:47,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:44:47,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2023-11-26 10:44:47,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 918065909, now seen corresponding path program 1 times [2023-11-26 10:44:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802104520] [2023-11-26 10:44:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:44:47,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802104520] [2023-11-26 10:44:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802104520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70058770] [2023-11-26 10:44:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:47,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 225 [2023-11-26 10:44:47,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 315 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:44:47,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:44:47,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 225 [2023-11-26 10:44:47,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand