./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX --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 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:26:04,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:26:04,299 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 18:26:04,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:26:04,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:26:04,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:26:04,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:26:04,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:26:04,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:26:04,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:26:04,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:26:04,354 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:26:04,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:26:04,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:26:04,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:26:04,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:26:04,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:26:04,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:26:04,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:26:04,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:26:04,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:26:04,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:26:04,363 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 18:26:04,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:26:04,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:26:04,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:26:04,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:26:04,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:26:04,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:26:04,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:26:04,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:26:04,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:04,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:26:04,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:26:04,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:26:04,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:26:04,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:26:04,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:26:04,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:26:04,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:26:04,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:26:04,373 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_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/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_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX 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 -> 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb [2024-11-08 18:26:04,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:26:04,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:26:04,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:26:04,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:26:04,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:26:04,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i Unable to find full path for "g++" [2024-11-08 18:26:06,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:26:07,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:26:07,309 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i [2024-11-08 18:26:07,329 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/data/08152d121/d5cc211a44224ab4a255f8de004d28b1/FLAG845327f6e [2024-11-08 18:26:07,362 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/data/08152d121/d5cc211a44224ab4a255f8de004d28b1 [2024-11-08 18:26:07,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:26:07,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:26:07,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:07,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:26:07,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:26:07,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:07" (1/1) ... [2024-11-08 18:26:07,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6448a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:07, skipping insertion in model container [2024-11-08 18:26:07,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:07" (1/1) ... [2024-11-08 18:26:07,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:26:08,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:08,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:26:08,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:08,449 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:26:08,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08 WrapperNode [2024-11-08 18:26:08,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:08,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:08,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:26:08,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:26:08,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,528 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2024-11-08 18:26:08,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:08,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:26:08,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:26:08,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:26:08,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:26:08,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:26:08,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:26:08,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:26:08,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (1/1) ... [2024-11-08 18:26:08,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:26:08,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:26:08,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a0874-72da-4f1a-a6b1-c03244950066/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:26:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:26:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-08 18:26:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 18:26:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 18:26:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-08 18:26:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:26:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:26:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-08 18:26:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-08 18:26:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 18:26:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-08 18:26:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-08 18:26:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:26:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:26:08,681 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:26:08,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:26:08,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:26:09,625 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:26:09,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:26:09,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:26:09,717 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-08 18:26:09,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:09 BoogieIcfgContainer [2024-11-08 18:26:09,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:26:09,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:26:09,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:26:09,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:26:09,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:07" (1/3) ... [2024-11-08 18:26:09,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46219d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:09, skipping insertion in model container [2024-11-08 18:26:09,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:08" (2/3) ... [2024-11-08 18:26:09,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46219d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:09, skipping insertion in model container [2024-11-08 18:26:09,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:09" (3/3) ... [2024-11-08 18:26:09,732 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-2.i [2024-11-08 18:26:09,755 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:26:09,755 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-08 18:26:09,756 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:26:09,914 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 18:26:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 455 transitions, 924 flow [2024-11-08 18:26:10,277 INFO L124 PetriNetUnfolderBase]: 21/580 cut-off events. [2024-11-08 18:26:10,278 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-08 18:26:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 580 events. 21/580 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 946 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 376. Up to 6 conditions per place. [2024-11-08 18:26:10,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 455 transitions, 924 flow [2024-11-08 18:26:10,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 376 places, 381 transitions, 772 flow [2024-11-08 18:26:10,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:26:10,350 INFO L333 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, 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;@3951a9cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:26:10,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-08 18:26:10,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:26:10,388 INFO L124 PetriNetUnfolderBase]: 0/139 cut-off events. [2024-11-08 18:26:10,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:26:10,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:10,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:10,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:10,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1575765055, now seen corresponding path program 1 times [2024-11-08 18:26:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878839210] [2024-11-08 18:26:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:10,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:10,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878839210] [2024-11-08 18:26:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878839210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153694542] [2024-11-08 18:26:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:11,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:11,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:11,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-08 18:26:11,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:11,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:11,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-08 18:26:11,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:12,401 INFO L124 PetriNetUnfolderBase]: 384/3043 cut-off events. [2024-11-08 18:26:12,401 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-08 18:26:12,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 3043 events. 384/3043 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 21650 event pairs, 264 based on Foata normal form. 97/2626 useless extension candidates. Maximal degree in co-relation 3452. Up to 604 conditions per place. [2024-11-08 18:26:12,438 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 26 selfloop transitions, 2 changer transitions 1/371 dead transitions. [2024-11-08 18:26:12,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 371 transitions, 808 flow [2024-11-08 18:26:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2024-11-08 18:26:12,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274725274725275 [2024-11-08 18:26:12,472 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 772 flow. Second operand 3 states and 1266 transitions. [2024-11-08 18:26:12,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 371 transitions, 808 flow [2024-11-08 18:26:12,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 371 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:26:12,496 INFO L231 Difference]: Finished difference. Result has 373 places, 370 transitions, 753 flow [2024-11-08 18:26:12,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=373, PETRI_TRANSITIONS=370} [2024-11-08 18:26:12,507 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -3 predicate places. [2024-11-08 18:26:12,508 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 370 transitions, 753 flow [2024-11-08 18:26:12,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:12,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:12,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:12,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:26:12,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:12,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:12,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1259359084, now seen corresponding path program 1 times [2024-11-08 18:26:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986559079] [2024-11-08 18:26:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986559079] [2024-11-08 18:26:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986559079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:12,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:12,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472403982] [2024-11-08 18:26:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:12,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:12,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2024-11-08 18:26:12,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 370 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:12,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:12,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2024-11-08 18:26:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:13,755 INFO L124 PetriNetUnfolderBase]: 434/3311 cut-off events. [2024-11-08 18:26:13,756 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-08 18:26:13,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 3311 events. 434/3311 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24196 event pairs, 309 based on Foata normal form. 0/2797 useless extension candidates. Maximal degree in co-relation 3883. Up to 688 conditions per place. [2024-11-08 18:26:13,787 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 29 selfloop transitions, 1 changer transitions 0/363 dead transitions. [2024-11-08 18:26:13,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 363 transitions, 799 flow [2024-11-08 18:26:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-08 18:26:13,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9062271062271062 [2024-11-08 18:26:13,793 INFO L175 Difference]: Start difference. First operand has 373 places, 370 transitions, 753 flow. Second operand 3 states and 1237 transitions. [2024-11-08 18:26:13,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 363 transitions, 799 flow [2024-11-08 18:26:13,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:13,805 INFO L231 Difference]: Finished difference. Result has 365 places, 363 transitions, 737 flow [2024-11-08 18:26:13,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=737, PETRI_PLACES=365, PETRI_TRANSITIONS=363} [2024-11-08 18:26:13,807 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-11-08 18:26:13,807 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 363 transitions, 737 flow [2024-11-08 18:26:13,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:13,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:13,808 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:13,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:26:13,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:13,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash -756177279, now seen corresponding path program 1 times [2024-11-08 18:26:13,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752312847] [2024-11-08 18:26:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:14,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752312847] [2024-11-08 18:26:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752312847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:14,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432506816] [2024-11-08 18:26:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:14,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:14,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 455 [2024-11-08 18:26:14,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 363 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:14,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:14,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 455 [2024-11-08 18:26:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:14,953 INFO L124 PetriNetUnfolderBase]: 416/2963 cut-off events. [2024-11-08 18:26:14,954 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-08 18:26:14,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 2963 events. 416/2963 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21425 event pairs, 297 based on Foata normal form. 0/2522 useless extension candidates. Maximal degree in co-relation 3504. Up to 659 conditions per place. [2024-11-08 18:26:14,987 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 22 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-08 18:26:14,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 783 flow [2024-11-08 18:26:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-11-08 18:26:14,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2024-11-08 18:26:14,993 INFO L175 Difference]: Start difference. First operand has 365 places, 363 transitions, 737 flow. Second operand 3 states and 1267 transitions. [2024-11-08 18:26:14,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 783 flow [2024-11-08 18:26:14,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 362 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:26:15,004 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 738 flow [2024-11-08 18:26:15,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-11-08 18:26:15,008 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-11-08 18:26:15,008 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 738 flow [2024-11-08 18:26:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:15,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:15,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:15,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:26:15,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 234318031, now seen corresponding path program 1 times [2024-11-08 18:26:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985911944] [2024-11-08 18:26:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:15,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985911944] [2024-11-08 18:26:15,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985911944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:15,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:15,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:15,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680818536] [2024-11-08 18:26:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:15,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:15,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-08 18:26:15,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:15,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:15,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-08 18:26:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:16,384 INFO L124 PetriNetUnfolderBase]: 554/3782 cut-off events. [2024-11-08 18:26:16,384 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-08 18:26:16,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 3782 events. 554/3782 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 29504 event pairs, 412 based on Foata normal form. 0/3236 useless extension candidates. Maximal degree in co-relation 4543. Up to 868 conditions per place. [2024-11-08 18:26:16,428 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 23 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-08 18:26:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 361 transitions, 786 flow [2024-11-08 18:26:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-08 18:26:16,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245421245421246 [2024-11-08 18:26:16,433 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 738 flow. Second operand 3 states and 1262 transitions. [2024-11-08 18:26:16,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 361 transitions, 786 flow [2024-11-08 18:26:16,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:16,441 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2024-11-08 18:26:16,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=364, PETRI_TRANSITIONS=361} [2024-11-08 18:26:16,443 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-11-08 18:26:16,443 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2024-11-08 18:26:16,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:16,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:16,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:16,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:26:16,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:16,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -443785218, now seen corresponding path program 1 times [2024-11-08 18:26:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829816293] [2024-11-08 18:26:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:16,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:16,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829816293] [2024-11-08 18:26:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829816293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:16,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:16,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197733883] [2024-11-08 18:26:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:16,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 455 [2024-11-08 18:26:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 361 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:16,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:16,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 455 [2024-11-08 18:26:16,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:17,478 INFO L124 PetriNetUnfolderBase]: 717/3617 cut-off events. [2024-11-08 18:26:17,479 INFO L125 PetriNetUnfolderBase]: For 63/101 co-relation queries the response was YES. [2024-11-08 18:26:17,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 3617 events. 717/3617 cut-off events. For 63/101 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 26921 event pairs, 505 based on Foata normal form. 0/2996 useless extension candidates. Maximal degree in co-relation 4585. Up to 1075 conditions per place. [2024-11-08 18:26:17,517 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 24 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-08 18:26:17,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 786 flow [2024-11-08 18:26:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-11-08 18:26:17,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-11-08 18:26:17,522 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1260 transitions. [2024-11-08 18:26:17,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 786 flow [2024-11-08 18:26:17,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:17,531 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2024-11-08 18:26:17,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=363, PETRI_TRANSITIONS=360} [2024-11-08 18:26:17,532 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-11-08 18:26:17,533 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2024-11-08 18:26:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:17,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:17,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:26:17,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:17,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:17,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1967694816, now seen corresponding path program 1 times [2024-11-08 18:26:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674687875] [2024-11-08 18:26:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674687875] [2024-11-08 18:26:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674687875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847388895] [2024-11-08 18:26:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:17,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:17,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:17,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:17,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:17,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 455 [2024-11-08 18:26:17,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 360 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:17,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:17,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 455 [2024-11-08 18:26:17,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:18,631 INFO L124 PetriNetUnfolderBase]: 1108/4011 cut-off events. [2024-11-08 18:26:18,631 INFO L125 PetriNetUnfolderBase]: For 79/134 co-relation queries the response was YES. [2024-11-08 18:26:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 4011 events. 1108/4011 cut-off events. For 79/134 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 29145 event pairs, 575 based on Foata normal form. 0/3519 useless extension candidates. Maximal degree in co-relation 5573. Up to 1645 conditions per place. [2024-11-08 18:26:18,675 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 34 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2024-11-08 18:26:18,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 366 transitions, 825 flow [2024-11-08 18:26:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2024-11-08 18:26:18,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164835164835164 [2024-11-08 18:26:18,680 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1251 transitions. [2024-11-08 18:26:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 366 transitions, 825 flow [2024-11-08 18:26:18,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 366 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:18,688 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 741 flow [2024-11-08 18:26:18,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-08 18:26:18,690 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-11-08 18:26:18,692 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 741 flow [2024-11-08 18:26:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:18,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:18,697 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:26:18,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1497304695, now seen corresponding path program 1 times [2024-11-08 18:26:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624902605] [2024-11-08 18:26:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:18,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:18,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624902605] [2024-11-08 18:26:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624902605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:18,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215947030] [2024-11-08 18:26:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:18,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-08 18:26:18,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:18,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:18,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-08 18:26:18,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:19,991 INFO L124 PetriNetUnfolderBase]: 550/3463 cut-off events. [2024-11-08 18:26:19,991 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-08 18:26:20,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 3463 events. 550/3463 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26469 event pairs, 373 based on Foata normal form. 0/3047 useless extension candidates. Maximal degree in co-relation 4284. Up to 877 conditions per place. [2024-11-08 18:26:20,029 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 28 selfloop transitions, 3 changer transitions 0/364 dead transitions. [2024-11-08 18:26:20,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 364 transitions, 815 flow [2024-11-08 18:26:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-08 18:26:20,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2024-11-08 18:26:20,034 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 741 flow. Second operand 3 states and 1270 transitions. [2024-11-08 18:26:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 364 transitions, 815 flow [2024-11-08 18:26:20,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 18:26:20,045 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 756 flow [2024-11-08 18:26:20,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-08 18:26:20,046 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-11-08 18:26:20,047 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 756 flow [2024-11-08 18:26:20,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:20,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:20,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:26:20,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 679996370, now seen corresponding path program 1 times [2024-11-08 18:26:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959612465] [2024-11-08 18:26:20,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959612465] [2024-11-08 18:26:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959612465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50296618] [2024-11-08 18:26:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:20,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-08 18:26:20,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:20,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:20,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-08 18:26:20,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:21,805 INFO L124 PetriNetUnfolderBase]: 1095/5816 cut-off events. [2024-11-08 18:26:21,805 INFO L125 PetriNetUnfolderBase]: For 87/93 co-relation queries the response was YES. [2024-11-08 18:26:21,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7794 conditions, 5816 events. 1095/5816 cut-off events. For 87/93 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 48121 event pairs, 396 based on Foata normal form. 0/5062 useless extension candidates. Maximal degree in co-relation 7645. Up to 908 conditions per place. [2024-11-08 18:26:21,862 INFO L140 encePairwiseOnDemand]: 444/455 looper letters, 40 selfloop transitions, 8 changer transitions 0/380 dead transitions. [2024-11-08 18:26:21,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 380 transitions, 902 flow [2024-11-08 18:26:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-11-08 18:26:21,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-11-08 18:26:21,867 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 756 flow. Second operand 3 states and 1281 transitions. [2024-11-08 18:26:21,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 380 transitions, 902 flow [2024-11-08 18:26:21,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 380 transitions, 902 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 18:26:21,876 INFO L231 Difference]: Finished difference. Result has 363 places, 366 transitions, 826 flow [2024-11-08 18:26:21,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=363, PETRI_TRANSITIONS=366} [2024-11-08 18:26:21,878 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-11-08 18:26:21,880 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 366 transitions, 826 flow [2024-11-08 18:26:21,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:21,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:21,881 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:21,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:26:21,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:21,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1092045327, now seen corresponding path program 1 times [2024-11-08 18:26:21,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65783713] [2024-11-08 18:26:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65783713] [2024-11-08 18:26:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65783713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:22,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972596865] [2024-11-08 18:26:22,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:22,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 455 [2024-11-08 18:26:22,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 366 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:22,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:22,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 455 [2024-11-08 18:26:22,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:24,414 INFO L124 PetriNetUnfolderBase]: 1920/9961 cut-off events. [2024-11-08 18:26:24,414 INFO L125 PetriNetUnfolderBase]: For 310/332 co-relation queries the response was YES. [2024-11-08 18:26:24,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13842 conditions, 9961 events. 1920/9961 cut-off events. For 310/332 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 93814 event pairs, 1079 based on Foata normal form. 0/9014 useless extension candidates. Maximal degree in co-relation 13691. Up to 2625 conditions per place. [2024-11-08 18:26:24,674 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 33 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-11-08 18:26:24,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 374 transitions, 917 flow [2024-11-08 18:26:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-08 18:26:24,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216117216117216 [2024-11-08 18:26:24,680 INFO L175 Difference]: Start difference. First operand has 363 places, 366 transitions, 826 flow. Second operand 3 states and 1258 transitions. [2024-11-08 18:26:24,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 374 transitions, 917 flow [2024-11-08 18:26:24,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 374 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:24,694 INFO L231 Difference]: Finished difference. Result has 360 places, 365 transitions, 823 flow [2024-11-08 18:26:24,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=360, PETRI_TRANSITIONS=365} [2024-11-08 18:26:24,696 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -16 predicate places. [2024-11-08 18:26:24,696 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 365 transitions, 823 flow [2024-11-08 18:26:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:24,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:24,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:26:24,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1254025886, now seen corresponding path program 1 times [2024-11-08 18:26:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083098710] [2024-11-08 18:26:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:25,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:25,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083098710] [2024-11-08 18:26:25,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083098710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:25,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882375103] [2024-11-08 18:26:25,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:25,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:25,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-08 18:26:25,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 365 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:25,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:25,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-08 18:26:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:27,902 INFO L124 PetriNetUnfolderBase]: 2962/12886 cut-off events. [2024-11-08 18:26:27,902 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-08 18:26:27,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18763 conditions, 12886 events. 2962/12886 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 124415 event pairs, 1539 based on Foata normal form. 0/11579 useless extension candidates. Maximal degree in co-relation 18611. Up to 3590 conditions per place. [2024-11-08 18:26:28,007 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 38 selfloop transitions, 9 changer transitions 0/383 dead transitions. [2024-11-08 18:26:28,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 383 transitions, 956 flow [2024-11-08 18:26:28,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2024-11-08 18:26:28,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362637362637363 [2024-11-08 18:26:28,013 INFO L175 Difference]: Start difference. First operand has 360 places, 365 transitions, 823 flow. Second operand 3 states and 1278 transitions. [2024-11-08 18:26:28,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 383 transitions, 956 flow [2024-11-08 18:26:28,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 383 transitions, 956 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 18:26:28,026 INFO L231 Difference]: Finished difference. Result has 364 places, 373 transitions, 893 flow [2024-11-08 18:26:28,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=364, PETRI_TRANSITIONS=373} [2024-11-08 18:26:28,028 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-11-08 18:26:28,028 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 373 transitions, 893 flow [2024-11-08 18:26:28,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:28,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:28,030 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:28,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:26:28,031 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1057787849, now seen corresponding path program 1 times [2024-11-08 18:26:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246149843] [2024-11-08 18:26:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246149843] [2024-11-08 18:26:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246149843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439419827] [2024-11-08 18:26:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:28,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:28,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-08 18:26:28,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 373 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:28,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:28,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-08 18:26:28,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:30,639 INFO L124 PetriNetUnfolderBase]: 1614/8990 cut-off events. [2024-11-08 18:26:30,639 INFO L125 PetriNetUnfolderBase]: For 346/360 co-relation queries the response was YES. [2024-11-08 18:26:30,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13133 conditions, 8990 events. 1614/8990 cut-off events. For 346/360 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 85742 event pairs, 1106 based on Foata normal form. 4/8066 useless extension candidates. Maximal degree in co-relation 12977. Up to 1812 conditions per place. [2024-11-08 18:26:30,709 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 34 selfloop transitions, 8 changer transitions 0/387 dead transitions. [2024-11-08 18:26:30,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 387 transitions, 1004 flow [2024-11-08 18:26:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:26:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-11-08 18:26:30,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234432234432235 [2024-11-08 18:26:30,719 INFO L175 Difference]: Start difference. First operand has 364 places, 373 transitions, 893 flow. Second operand 6 states and 2521 transitions. [2024-11-08 18:26:30,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 387 transitions, 1004 flow [2024-11-08 18:26:30,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 387 transitions, 986 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:30,737 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 920 flow [2024-11-08 18:26:30,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2024-11-08 18:26:30,739 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -5 predicate places. [2024-11-08 18:26:30,739 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 920 flow [2024-11-08 18:26:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:30,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:30,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:30,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:26:30,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash -128299593, now seen corresponding path program 1 times [2024-11-08 18:26:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906188507] [2024-11-08 18:26:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906188507] [2024-11-08 18:26:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906188507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757814293] [2024-11-08 18:26:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:31,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:31,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-08 18:26:31,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:31,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:31,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-08 18:26:31,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:34,195 INFO L124 PetriNetUnfolderBase]: 2381/11691 cut-off events. [2024-11-08 18:26:34,195 INFO L125 PetriNetUnfolderBase]: For 879/996 co-relation queries the response was YES. [2024-11-08 18:26:34,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17903 conditions, 11691 events. 2381/11691 cut-off events. For 879/996 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 114647 event pairs, 1326 based on Foata normal form. 31/10532 useless extension candidates. Maximal degree in co-relation 17742. Up to 2964 conditions per place. [2024-11-08 18:26:34,278 INFO L140 encePairwiseOnDemand]: 450/455 looper letters, 38 selfloop transitions, 6 changer transitions 0/389 dead transitions. [2024-11-08 18:26:34,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 389 transitions, 1043 flow [2024-11-08 18:26:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2024-11-08 18:26:34,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347985347985348 [2024-11-08 18:26:34,283 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 920 flow. Second operand 3 states and 1276 transitions. [2024-11-08 18:26:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 389 transitions, 1043 flow [2024-11-08 18:26:34,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 389 transitions, 1039 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:26:34,294 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 970 flow [2024-11-08 18:26:34,295 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2024-11-08 18:26:34,296 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -2 predicate places. [2024-11-08 18:26:34,296 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 970 flow [2024-11-08 18:26:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:34,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:34,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:26:34,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1589445868, now seen corresponding path program 1 times [2024-11-08 18:26:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801602572] [2024-11-08 18:26:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801602572] [2024-11-08 18:26:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801602572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:34,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:26:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88393922] [2024-11-08 18:26:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:34,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:26:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:26:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:26:34,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 455 [2024-11-08 18:26:34,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 970 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:34,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:34,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 455 [2024-11-08 18:26:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:38,999 INFO L124 PetriNetUnfolderBase]: 5084/19054 cut-off events. [2024-11-08 18:26:38,999 INFO L125 PetriNetUnfolderBase]: For 4224/4805 co-relation queries the response was YES. [2024-11-08 18:26:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33270 conditions, 19054 events. 5084/19054 cut-off events. For 4224/4805 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 195319 event pairs, 3234 based on Foata normal form. 17/17291 useless extension candidates. Maximal degree in co-relation 33109. Up to 7154 conditions per place. [2024-11-08 18:26:39,143 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 52 selfloop transitions, 13 changer transitions 0/400 dead transitions. [2024-11-08 18:26:39,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 400 transitions, 1161 flow [2024-11-08 18:26:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:26:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:26:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2024-11-08 18:26:39,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2024-11-08 18:26:39,148 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 970 flow. Second operand 3 states and 1248 transitions. [2024-11-08 18:26:39,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 400 transitions, 1161 flow [2024-11-08 18:26:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 400 transitions, 1145 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:39,196 INFO L231 Difference]: Finished difference. Result has 376 places, 391 transitions, 1066 flow [2024-11-08 18:26:39,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=376, PETRI_TRANSITIONS=391} [2024-11-08 18:26:39,199 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 0 predicate places. [2024-11-08 18:26:39,199 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 391 transitions, 1066 flow [2024-11-08 18:26:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:39,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:39,201 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:39,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:26:39,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash 601504241, now seen corresponding path program 1 times [2024-11-08 18:26:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934716443] [2024-11-08 18:26:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:26:40,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:40,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934716443] [2024-11-08 18:26:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934716443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:40,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417758876] [2024-11-08 18:26:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:40,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:40,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:40,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 455 [2024-11-08 18:26:40,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 391 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 397.8333333333333) internal successors, (2387), 6 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:40,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:40,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 455 [2024-11-08 18:26:40,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:46,193 INFO L124 PetriNetUnfolderBase]: 6465/23266 cut-off events. [2024-11-08 18:26:46,193 INFO L125 PetriNetUnfolderBase]: For 12562/13128 co-relation queries the response was YES. [2024-11-08 18:26:46,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44279 conditions, 23266 events. 6465/23266 cut-off events. For 12562/13128 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 246659 event pairs, 3397 based on Foata normal form. 33/21090 useless extension candidates. Maximal degree in co-relation 44116. Up to 7836 conditions per place. [2024-11-08 18:26:46,364 INFO L140 encePairwiseOnDemand]: 441/455 looper letters, 98 selfloop transitions, 54 changer transitions 0/486 dead transitions. [2024-11-08 18:26:46,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 486 transitions, 1776 flow [2024-11-08 18:26:46,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:26:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2492 transitions. [2024-11-08 18:26:46,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9128205128205128 [2024-11-08 18:26:46,371 INFO L175 Difference]: Start difference. First operand has 376 places, 391 transitions, 1066 flow. Second operand 6 states and 2492 transitions. [2024-11-08 18:26:46,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 486 transitions, 1776 flow [2024-11-08 18:26:46,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 486 transitions, 1694 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-08 18:26:46,456 INFO L231 Difference]: Finished difference. Result has 383 places, 443 transitions, 1496 flow [2024-11-08 18:26:46,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1496, PETRI_PLACES=383, PETRI_TRANSITIONS=443} [2024-11-08 18:26:46,458 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 7 predicate places. [2024-11-08 18:26:46,458 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 443 transitions, 1496 flow [2024-11-08 18:26:46,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.8333333333333) internal successors, (2387), 6 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:46,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:46,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:26:46,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:46,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1270403552, now seen corresponding path program 1 times [2024-11-08 18:26:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971376473] [2024-11-08 18:26:46,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:47,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:47,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971376473] [2024-11-08 18:26:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971376473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393038946] [2024-11-08 18:26:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:47,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:47,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-08 18:26:47,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 443 transitions, 1496 flow. Second operand has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:47,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:47,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-08 18:26:47,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:51,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][445], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 240#L1072-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 70#L1038-6true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|)]) [2024-11-08 18:26:51,427 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-08 18:26:51,427 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:26:51,427 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:26:51,427 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-08 18:26:51,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][420], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 240#L1072-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 93#L1039true]) [2024-11-08 18:26:51,500 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2024-11-08 18:26:51,500 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:26:51,500 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-08 18:26:51,500 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:26:51,959 INFO L124 PetriNetUnfolderBase]: 3986/19598 cut-off events. [2024-11-08 18:26:51,959 INFO L125 PetriNetUnfolderBase]: For 6579/7012 co-relation queries the response was YES. [2024-11-08 18:26:52,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35525 conditions, 19598 events. 3986/19598 cut-off events. For 6579/7012 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 212061 event pairs, 1729 based on Foata normal form. 19/17875 useless extension candidates. Maximal degree in co-relation 35357. Up to 4010 conditions per place. [2024-11-08 18:26:52,101 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 25 selfloop transitions, 4 changer transitions 17/455 dead transitions. [2024-11-08 18:26:52,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 455 transitions, 1607 flow [2024-11-08 18:26:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:26:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-11-08 18:26:52,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2024-11-08 18:26:52,107 INFO L175 Difference]: Start difference. First operand has 383 places, 443 transitions, 1496 flow. Second operand 6 states and 2522 transitions. [2024-11-08 18:26:52,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 455 transitions, 1607 flow [2024-11-08 18:26:52,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 455 transitions, 1567 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-11-08 18:26:52,150 INFO L231 Difference]: Finished difference. Result has 390 places, 438 transitions, 1443 flow [2024-11-08 18:26:52,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1443, PETRI_PLACES=390, PETRI_TRANSITIONS=438} [2024-11-08 18:26:52,151 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 14 predicate places. [2024-11-08 18:26:52,151 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 438 transitions, 1443 flow [2024-11-08 18:26:52,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:52,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:52,153 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:52,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:26:52,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:52,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1230081436, now seen corresponding path program 1 times [2024-11-08 18:26:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:52,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382400499] [2024-11-08 18:26:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:26:52,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382400499] [2024-11-08 18:26:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382400499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:52,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:26:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671850896] [2024-11-08 18:26:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:52,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:26:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:52,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:26:52,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:26:53,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 455 [2024-11-08 18:26:53,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 438 transitions, 1443 flow. Second operand has 8 states, 8 states have (on average 402.875) internal successors, (3223), 8 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:53,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:26:53,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 455 [2024-11-08 18:26:53,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:26:58,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][427], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 70#L1038-6true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-08 18:26:58,947 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2024-11-08 18:26:58,947 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-08 18:26:58,947 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-08 18:26:58,947 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-08 18:26:59,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 93#L1039true, 127#L1061-11true]) [2024-11-08 18:26:59,003 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2024-11-08 18:26:59,004 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-08 18:26:59,004 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-08 18:26:59,004 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-08 18:26:59,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, 194#L1034-2true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-08 18:26:59,120 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-08 18:26:59,120 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-08 18:26:59,120 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:26:59,121 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:26:59,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([945] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-08 18:26:59,185 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2024-11-08 18:26:59,185 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-08 18:26:59,185 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-08 18:26:59,185 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-08 18:26:59,640 INFO L124 PetriNetUnfolderBase]: 6184/23998 cut-off events. [2024-11-08 18:26:59,640 INFO L125 PetriNetUnfolderBase]: For 17541/18474 co-relation queries the response was YES. [2024-11-08 18:26:59,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49503 conditions, 23998 events. 6184/23998 cut-off events. For 17541/18474 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 258656 event pairs, 2178 based on Foata normal form. 42/22081 useless extension candidates. Maximal degree in co-relation 49329. Up to 5440 conditions per place. [2024-11-08 18:26:59,834 INFO L140 encePairwiseOnDemand]: 442/455 looper letters, 100 selfloop transitions, 48 changer transitions 0/497 dead transitions. [2024-11-08 18:26:59,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 497 transitions, 2068 flow [2024-11-08 18:26:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:26:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 18:26:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4493 transitions. [2024-11-08 18:26:59,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8977022977022977 [2024-11-08 18:26:59,845 INFO L175 Difference]: Start difference. First operand has 390 places, 438 transitions, 1443 flow. Second operand 11 states and 4493 transitions. [2024-11-08 18:26:59,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 497 transitions, 2068 flow [2024-11-08 18:26:59,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 497 transitions, 2036 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-08 18:26:59,917 INFO L231 Difference]: Finished difference. Result has 391 places, 461 transitions, 1810 flow [2024-11-08 18:26:59,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1810, PETRI_PLACES=391, PETRI_TRANSITIONS=461} [2024-11-08 18:26:59,919 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 15 predicate places. [2024-11-08 18:26:59,919 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 461 transitions, 1810 flow [2024-11-08 18:26:59,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 402.875) internal successors, (3223), 8 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:26:59,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:26:59,922 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:59,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:26:59,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:26:59,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash 354589207, now seen corresponding path program 1 times [2024-11-08 18:26:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630627565] [2024-11-08 18:26:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:27:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630627565] [2024-11-08 18:27:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630627565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:27:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557887943] [2024-11-08 18:27:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:00,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:27:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:27:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:27:00,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-08 18:27:00,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 461 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:27:00,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:27:00,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-08 18:27:00,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:27:02,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][222], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 171#ULTIMATE.startFINALtrue, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:02,202 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2024-11-08 18:27:02,202 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-08 18:27:02,202 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-08 18:27:02,202 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-08 18:27:02,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][222], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 171#ULTIMATE.startFINALtrue, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:02,261 INFO L294 olderBase$Statistics]: this new event has 305 ancestors and is cut-off event [2024-11-08 18:27:02,261 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-08 18:27:02,261 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-08 18:27:02,261 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-08 18:27:04,622 INFO L124 PetriNetUnfolderBase]: 3989/18763 cut-off events. [2024-11-08 18:27:04,622 INFO L125 PetriNetUnfolderBase]: For 12526/13365 co-relation queries the response was YES. [2024-11-08 18:27:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36577 conditions, 18763 events. 3989/18763 cut-off events. For 12526/13365 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 204971 event pairs, 1708 based on Foata normal form. 69/16968 useless extension candidates. Maximal degree in co-relation 36411. Up to 3802 conditions per place. [2024-11-08 18:27:04,781 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 36 selfloop transitions, 7 changer transitions 0/473 dead transitions. [2024-11-08 18:27:04,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 473 transitions, 1929 flow [2024-11-08 18:27:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:27:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:27:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2024-11-08 18:27:04,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-08 18:27:04,785 INFO L175 Difference]: Start difference. First operand has 391 places, 461 transitions, 1810 flow. Second operand 3 states and 1274 transitions. [2024-11-08 18:27:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 473 transitions, 1929 flow [2024-11-08 18:27:04,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 473 transitions, 1902 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-08 18:27:04,870 INFO L231 Difference]: Finished difference. Result has 389 places, 466 transitions, 1839 flow [2024-11-08 18:27:04,871 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=389, PETRI_TRANSITIONS=466} [2024-11-08 18:27:04,871 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 13 predicate places. [2024-11-08 18:27:04,872 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 466 transitions, 1839 flow [2024-11-08 18:27:04,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:27:04,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:27:04,873 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:27:04,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:27:04,873 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-08 18:27:04,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1081556627, now seen corresponding path program 1 times [2024-11-08 18:27:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:04,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952332605] [2024-11-08 18:27:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 18:27:05,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952332605] [2024-11-08 18:27:05,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952332605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:27:05,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277271896] [2024-11-08 18:27:05,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:05,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:27:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:27:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:27:05,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2024-11-08 18:27:05,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 466 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:27:05,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:27:05,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2024-11-08 18:27:05,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:27:08,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:08,826 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,827 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,827 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,827 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,950 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 70#L1038-6true, Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:08,950 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,950 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,950 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,950 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,950 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,952 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:08,952 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,953 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,953 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,953 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,953 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,953 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:08,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 397#L1061-7true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-08 18:27:08,985 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-08 18:27:08,985 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-08 18:27:08,985 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-08 18:27:08,985 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-08 18:27:09,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,045 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,046 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,046 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,046 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][511], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, 11#L1029-6true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,064 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,064 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,064 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,064 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,067 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,067 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,067 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,067 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,067 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,067 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 6#L1061-8true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-08 18:27:09,102 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,102 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,102 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-08 18:27:09,102 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-08 18:27:09,175 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 553#true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,175 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,175 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,176 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,176 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,176 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,176 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 332#L1061-9true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-08 18:27:09,225 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,226 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,226 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,226 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-08 18:27:09,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][389], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 70#L1038-6true, Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 57#L1030true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,320 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,320 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,321 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,321 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 57#L1030true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,341 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,341 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,341 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,341 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-08 18:27:09,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 164#L1061-10true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-08 18:27:09,371 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-08 18:27:09,371 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-08 18:27:09,372 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-08 18:27:09,372 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-08 18:27:09,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([876] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 127#L1061-11true]) [2024-11-08 18:27:09,482 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-08 18:27:09,482 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-08 18:27:09,483 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-08 18:27:09,483 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-08 18:27:09,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][389], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,646 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,646 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,646 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,646 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([899] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-08 18:27:09,664 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,664 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,664 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-08 18:27:09,664 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event