./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1 --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 af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-01 23:08:57,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-01 23:08:57,646 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-12-01 23:08:57,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-01 23:08:57,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-01 23:08:57,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-01 23:08:57,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-01 23:08:57,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-01 23:08:57,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-01 23:08:57,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-01 23:08:57,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-01 23:08:57,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-01 23:08:57,673 INFO L153 SettingsManager]: * Use SBE=true [2024-12-01 23:08:57,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-01 23:08:57,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-01 23:08:57,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-01 23:08:57,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-01 23:08:57,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-01 23:08:57,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:08:57,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-01 23:08:57,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:08:57,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-01 23:08:57,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-01 23:08:57,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-01 23:08:57,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1 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 -> af00d5f4cc6a18cb9fd8a5151467217fe3ddb5ee0fa30b2cfbd9dd374105ee15 [2024-12-01 23:08:57,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-01 23:08:57,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-01 23:08:57,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-01 23:08:57,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-01 23:08:57,900 INFO L274 PluginConnector]: CDTParser initialized [2024-12-01 23:08:57,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-01 23:09:00,531 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/data/800d2cdbf/db2c36115fa941778c38a1484f08c9aa/FLAG1f477ca79 [2024-12-01 23:09:00,790 INFO L384 CDTParser]: Found 1 translation units. [2024-12-01 23:09:00,790 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/sv-benchmarks/c/goblint-regression/28-race_reach_41-trylock_racefree.i [2024-12-01 23:09:00,803 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/data/800d2cdbf/db2c36115fa941778c38a1484f08c9aa/FLAG1f477ca79 [2024-12-01 23:09:01,097 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/data/800d2cdbf/db2c36115fa941778c38a1484f08c9aa [2024-12-01 23:09:01,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-01 23:09:01,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-01 23:09:01,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-01 23:09:01,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-01 23:09:01,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-01 23:09:01,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b504009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01, skipping insertion in model container [2024-12-01 23:09:01,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-01 23:09:01,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:09:01,381 INFO L200 MainTranslator]: Completed pre-run [2024-12-01 23:09:01,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-01 23:09:01,452 INFO L204 MainTranslator]: Completed translation [2024-12-01 23:09:01,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01 WrapperNode [2024-12-01 23:09:01,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-01 23:09:01,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-01 23:09:01,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-01 23:09:01,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-01 23:09:01,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,489 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2024-12-01 23:09:01,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-01 23:09:01,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-01 23:09:01,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-01 23:09:01,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-01 23:09:01,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-01 23:09:01,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-01 23:09:01,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-01 23:09:01,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-01 23:09:01,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (1/1) ... [2024-12-01 23:09:01,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-01 23:09:01,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-01 23:09:01,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-01 23:09:01,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b81f4443-8c2f-4eab-9ad0-ae61f3f0f0d9/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-01 23:09:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-01 23:09:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-01 23:09:01,558 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-01 23:09:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-01 23:09:01,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-01 23:09:01,560 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-01 23:09:01,663 INFO L234 CfgBuilder]: Building ICFG [2024-12-01 23:09:01,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-01 23:09:01,867 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-01 23:09:01,867 INFO L283 CfgBuilder]: Performing block encoding [2024-12-01 23:09:01,895 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-01 23:09:01,895 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-12-01 23:09:01,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:09:01 BoogieIcfgContainer [2024-12-01 23:09:01,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-01 23:09:01,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-01 23:09:01,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-01 23:09:01,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-01 23:09:01,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 11:09:01" (1/3) ... [2024-12-01 23:09:01,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa94750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:09:01, skipping insertion in model container [2024-12-01 23:09:01,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 11:09:01" (2/3) ... [2024-12-01 23:09:01,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa94750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 11:09:01, skipping insertion in model container [2024-12-01 23:09:01,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 11:09:01" (3/3) ... [2024-12-01 23:09:01,904 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2024-12-01 23:09:01,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-01 23:09:01,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_41-trylock_racefree.i that has 2 procedures, 129 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2024-12-01 23:09:01,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-01 23:09:01,972 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-01 23:09:02,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 144 transitions, 295 flow [2024-12-01 23:09:02,078 INFO L124 PetriNetUnfolderBase]: 23/207 cut-off events. [2024-12-01 23:09:02,080 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-12-01 23:09:02,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 207 events. 23/207 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 665 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 113. Up to 6 conditions per place. [2024-12-01 23:09:02,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 144 transitions, 295 flow [2024-12-01 23:09:02,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 144 transitions, 295 flow [2024-12-01 23:09:02,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:09:02,107 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;@49505c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:09:02,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-12-01 23:09:02,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-01 23:09:02,135 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2024-12-01 23:09:02,135 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-01 23:09:02,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:02,136 INFO L206 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] [2024-12-01 23:09:02,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:02,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:02,141 INFO L85 PathProgramCache]: Analyzing trace with hash -234290657, now seen corresponding path program 1 times [2024-12-01 23:09:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:02,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201537387] [2024-12-01 23:09:02,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201537387] [2024-12-01 23:09:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201537387] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:02,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991365872] [2024-12-01 23:09:02,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:02,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:09:02,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:02,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:09:02,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:09:02,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144 [2024-12-01 23:09:02,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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-12-01 23:09:02,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:02,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144 [2024-12-01 23:09:02,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:02,457 INFO L124 PetriNetUnfolderBase]: 27/367 cut-off events. [2024-12-01 23:09:02,458 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-01 23:09:02,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 367 events. 27/367 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1460 event pairs, 24 based on Foata normal form. 54/383 useless extension candidates. Maximal degree in co-relation 340. Up to 65 conditions per place. [2024-12-01 23:09:02,461 INFO L140 encePairwiseOnDemand]: 131/144 looper letters, 12 selfloop transitions, 0 changer transitions 0/129 dead transitions. [2024-12-01 23:09:02,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 289 flow [2024-12-01 23:09:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:09:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-12-01 23:09:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2024-12-01 23:09:02,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.90625 [2024-12-01 23:09:02,475 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 295 flow. Second operand 2 states and 261 transitions. [2024-12-01 23:09:02,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 289 flow [2024-12-01 23:09:02,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:02,484 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 265 flow [2024-12-01 23:09:02,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=265, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-12-01 23:09:02,490 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, -1 predicate places. [2024-12-01 23:09:02,490 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 265 flow [2024-12-01 23:09:02,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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-12-01 23:09:02,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:02,490 INFO L206 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] [2024-12-01 23:09:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-01 23:09:02,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:02,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1843447968, now seen corresponding path program 1 times [2024-12-01 23:09:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640971809] [2024-12-01 23:09:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640971809] [2024-12-01 23:09:02,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640971809] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:09:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312814827] [2024-12-01 23:09:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:02,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:02,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:02,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:02,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2024-12-01 23:09:02,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-12-01 23:09:02,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:02,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2024-12-01 23:09:02,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:02,721 INFO L124 PetriNetUnfolderBase]: 55/546 cut-off events. [2024-12-01 23:09:02,722 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-12-01 23:09:02,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 546 events. 55/546 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2685 event pairs, 0 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 664. Up to 108 conditions per place. [2024-12-01 23:09:02,725 INFO L140 encePairwiseOnDemand]: 141/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-12-01 23:09:02,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 135 transitions, 325 flow [2024-12-01 23:09:02,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-12-01 23:09:02,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2024-12-01 23:09:02,728 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 265 flow. Second operand 3 states and 361 transitions. [2024-12-01 23:09:02,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 135 transitions, 325 flow [2024-12-01 23:09:02,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:02,732 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 273 flow [2024-12-01 23:09:02,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-12-01 23:09:02,733 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 2 predicate places. [2024-12-01 23:09:02,733 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 273 flow [2024-12-01 23:09:02,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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-12-01 23:09:02,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:02,734 INFO L206 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] [2024-12-01 23:09:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-01 23:09:02,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -46109310, now seen corresponding path program 1 times [2024-12-01 23:09:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278946054] [2024-12-01 23:09:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278946054] [2024-12-01 23:09:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278946054] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:03,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56418633] [2024-12-01 23:09:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 23:09:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:03,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 23:09:03,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:09:03,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 144 [2024-12-01 23:09:03,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 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-12-01 23:09:03,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:03,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 144 [2024-12-01 23:09:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:03,458 INFO L124 PetriNetUnfolderBase]: 115/598 cut-off events. [2024-12-01 23:09:03,458 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-12-01 23:09:03,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 598 events. 115/598 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3392 event pairs, 12 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 880. Up to 181 conditions per place. [2024-12-01 23:09:03,461 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 48 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2024-12-01 23:09:03,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 425 flow [2024-12-01 23:09:03,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:09:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-01 23:09:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 654 transitions. [2024-12-01 23:09:03,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2024-12-01 23:09:03,465 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 273 flow. Second operand 6 states and 654 transitions. [2024-12-01 23:09:03,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 425 flow [2024-12-01 23:09:03,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:03,468 INFO L231 Difference]: Finished difference. Result has 136 places, 128 transitions, 277 flow [2024-12-01 23:09:03,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=136, PETRI_TRANSITIONS=128} [2024-12-01 23:09:03,469 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 4 predicate places. [2024-12-01 23:09:03,469 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 128 transitions, 277 flow [2024-12-01 23:09:03,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 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-12-01 23:09:03,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:03,470 INFO L206 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] [2024-12-01 23:09:03,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-01 23:09:03,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:03,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash 38077828, now seen corresponding path program 1 times [2024-12-01 23:09:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:03,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556576655] [2024-12-01 23:09:03,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:03,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556576655] [2024-12-01 23:09:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556576655] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:03,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:03,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157861125] [2024-12-01 23:09:03,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:03,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:03,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:03,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:03,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:03,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2024-12-01 23:09:03,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 128 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-12-01 23:09:03,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:03,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2024-12-01 23:09:03,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:03,675 INFO L124 PetriNetUnfolderBase]: 92/791 cut-off events. [2024-12-01 23:09:03,675 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-12-01 23:09:03,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 791 events. 92/791 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4725 event pairs, 30 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 1022. Up to 125 conditions per place. [2024-12-01 23:09:03,678 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/141 dead transitions. [2024-12-01 23:09:03,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 141 transitions, 378 flow [2024-12-01 23:09:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2024-12-01 23:09:03,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-12-01 23:09:03,680 INFO L175 Difference]: Start difference. First operand has 136 places, 128 transitions, 277 flow. Second operand 3 states and 360 transitions. [2024-12-01 23:09:03,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 141 transitions, 378 flow [2024-12-01 23:09:03,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 141 transitions, 368 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-01 23:09:03,682 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 305 flow [2024-12-01 23:09:03,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2024-12-01 23:09:03,683 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 1 predicate places. [2024-12-01 23:09:03,683 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 305 flow [2024-12-01 23:09:03,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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-12-01 23:09:03,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:03,684 INFO L206 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] [2024-12-01 23:09:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-01 23:09:03,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:03,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:03,685 INFO L85 PathProgramCache]: Analyzing trace with hash 602896067, now seen corresponding path program 1 times [2024-12-01 23:09:03,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:03,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525130271] [2024-12-01 23:09:03,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:03,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525130271] [2024-12-01 23:09:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525130271] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4484055] [2024-12-01 23:09:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:03,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:03,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:03,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:03,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 144 [2024-12-01 23:09:03,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 130 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-12-01 23:09:03,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:03,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 144 [2024-12-01 23:09:03,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:03,865 INFO L124 PetriNetUnfolderBase]: 95/793 cut-off events. [2024-12-01 23:09:03,866 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-12-01 23:09:03,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 793 events. 95/793 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4795 event pairs, 60 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1121. Up to 189 conditions per place. [2024-12-01 23:09:03,868 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 27 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-12-01 23:09:03,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 385 flow [2024-12-01 23:09:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-12-01 23:09:03,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2024-12-01 23:09:03,871 INFO L175 Difference]: Start difference. First operand has 133 places, 130 transitions, 305 flow. Second operand 3 states and 356 transitions. [2024-12-01 23:09:03,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 385 flow [2024-12-01 23:09:03,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 137 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:03,874 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 325 flow [2024-12-01 23:09:03,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2024-12-01 23:09:03,875 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 3 predicate places. [2024-12-01 23:09:03,875 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 325 flow [2024-12-01 23:09:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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-12-01 23:09:03,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:03,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:03,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-01 23:09:03,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-12-01 23:09:03,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1509502701, now seen corresponding path program 1 times [2024-12-01 23:09:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696504471] [2024-12-01 23:09:03,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:09:03,902 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-01 23:09:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:09:03,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-01 23:09:03,934 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-01 23:09:03,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-12-01 23:09:03,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-12-01 23:09:03,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-12-01 23:09:03,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-12-01 23:09:03,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-12-01 23:09:03,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-12-01 23:09:03,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-01 23:09:03,937 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-12-01 23:09:03,939 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-01 23:09:03,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-01 23:09:03,967 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-01 23:09:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 193 transitions, 402 flow [2024-12-01 23:09:04,006 INFO L124 PetriNetUnfolderBase]: 40/347 cut-off events. [2024-12-01 23:09:04,006 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-12-01 23:09:04,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 347 events. 40/347 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1228 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 209. Up to 9 conditions per place. [2024-12-01 23:09:04,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 193 transitions, 402 flow [2024-12-01 23:09:04,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 193 transitions, 402 flow [2024-12-01 23:09:04,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:09:04,011 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;@49505c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:09:04,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-12-01 23:09:04,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-01 23:09:04,015 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2024-12-01 23:09:04,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-01 23:09:04,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:04,015 INFO L206 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] [2024-12-01 23:09:04,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash -825048033, now seen corresponding path program 1 times [2024-12-01 23:09:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42957309] [2024-12-01 23:09:04,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42957309] [2024-12-01 23:09:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42957309] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999023829] [2024-12-01 23:09:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:09:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:04,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:09:04,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:09:04,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2024-12-01 23:09:04,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 193 transitions, 402 flow. Second operand has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 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-12-01 23:09:04,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:04,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2024-12-01 23:09:04,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:04,427 INFO L124 PetriNetUnfolderBase]: 421/2602 cut-off events. [2024-12-01 23:09:04,428 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-12-01 23:09:04,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 2602 events. 421/2602 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 21185 event pairs, 414 based on Foata normal form. 577/2911 useless extension candidates. Maximal degree in co-relation 2797. Up to 716 conditions per place. [2024-12-01 23:09:04,438 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 20 selfloop transitions, 0 changer transitions 0/172 dead transitions. [2024-12-01 23:09:04,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 400 flow [2024-12-01 23:09:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:09:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-12-01 23:09:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 345 transitions. [2024-12-01 23:09:04,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937823834196891 [2024-12-01 23:09:04,440 INFO L175 Difference]: Start difference. First operand has 176 places, 193 transitions, 402 flow. Second operand 2 states and 345 transitions. [2024-12-01 23:09:04,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 400 flow [2024-12-01 23:09:04,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:04,442 INFO L231 Difference]: Finished difference. Result has 175 places, 172 transitions, 360 flow [2024-12-01 23:09:04,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2024-12-01 23:09:04,443 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, -1 predicate places. [2024-12-01 23:09:04,443 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 360 flow [2024-12-01 23:09:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 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-12-01 23:09:04,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:04,443 INFO L206 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] [2024-12-01 23:09:04,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-01 23:09:04,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:04,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1669370240, now seen corresponding path program 1 times [2024-12-01 23:09:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:04,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118974664] [2024-12-01 23:09:04,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118974664] [2024-12-01 23:09:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118974664] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:09:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680928610] [2024-12-01 23:09:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:04,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:04,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:04,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 193 [2024-12-01 23:09:04,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 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-12-01 23:09:04,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:04,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 193 [2024-12-01 23:09:04,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:04,979 INFO L124 PetriNetUnfolderBase]: 802/4340 cut-off events. [2024-12-01 23:09:04,979 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-12-01 23:09:04,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5694 conditions, 4340 events. 802/4340 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 41492 event pairs, 348 based on Foata normal form. 1/3941 useless extension candidates. Maximal degree in co-relation 5689. Up to 1303 conditions per place. [2024-12-01 23:09:04,996 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 31 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-12-01 23:09:04,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 440 flow [2024-12-01 23:09:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2024-12-01 23:09:04,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8203799654576857 [2024-12-01 23:09:04,999 INFO L175 Difference]: Start difference. First operand has 175 places, 172 transitions, 360 flow. Second operand 3 states and 475 transitions. [2024-12-01 23:09:04,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 440 flow [2024-12-01 23:09:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:05,002 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 372 flow [2024-12-01 23:09:05,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2024-12-01 23:09:05,003 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-12-01 23:09:05,003 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 372 flow [2024-12-01 23:09:05,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 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-12-01 23:09:05,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:05,004 INFO L206 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] [2024-12-01 23:09:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-01 23:09:05,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:05,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1477072931, now seen corresponding path program 1 times [2024-12-01 23:09:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060308084] [2024-12-01 23:09:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:05,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:05,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060308084] [2024-12-01 23:09:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060308084] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:05,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:05,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:05,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001697477] [2024-12-01 23:09:05,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:05,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 23:09:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:05,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 23:09:05,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:09:05,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 193 [2024-12-01 23:09:05,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 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-12-01 23:09:05,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:05,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 193 [2024-12-01 23:09:05,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:06,014 INFO L124 PetriNetUnfolderBase]: 1739/6865 cut-off events. [2024-12-01 23:09:06,015 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-12-01 23:09:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9836 conditions, 6865 events. 1739/6865 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 68757 event pairs, 760 based on Foata normal form. 0/6164 useless extension candidates. Maximal degree in co-relation 9829. Up to 2015 conditions per place. [2024-12-01 23:09:06,047 INFO L140 encePairwiseOnDemand]: 187/193 looper letters, 80 selfloop transitions, 6 changer transitions 0/220 dead transitions. [2024-12-01 23:09:06,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 220 transitions, 638 flow [2024-12-01 23:09:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:09:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-01 23:09:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 896 transitions. [2024-12-01 23:09:06,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7737478411053541 [2024-12-01 23:09:06,050 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 372 flow. Second operand 6 states and 896 transitions. [2024-12-01 23:09:06,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 220 transitions, 638 flow [2024-12-01 23:09:06,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 220 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-01 23:09:06,053 INFO L231 Difference]: Finished difference. Result has 181 places, 172 transitions, 380 flow [2024-12-01 23:09:06,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=181, PETRI_TRANSITIONS=172} [2024-12-01 23:09:06,054 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 5 predicate places. [2024-12-01 23:09:06,054 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 172 transitions, 380 flow [2024-12-01 23:09:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 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-12-01 23:09:06,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:06,055 INFO L206 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] [2024-12-01 23:09:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-01 23:09:06,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:06,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 67223923, now seen corresponding path program 1 times [2024-12-01 23:09:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192438739] [2024-12-01 23:09:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192438739] [2024-12-01 23:09:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192438739] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989554205] [2024-12-01 23:09:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:06,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:06,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:06,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 193 [2024-12-01 23:09:06,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 172 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-12-01 23:09:06,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:06,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 193 [2024-12-01 23:09:06,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:07,343 INFO L124 PetriNetUnfolderBase]: 4085/14792 cut-off events. [2024-12-01 23:09:07,343 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-12-01 23:09:07,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21539 conditions, 14792 events. 4085/14792 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 164339 event pairs, 1409 based on Foata normal form. 0/13243 useless extension candidates. Maximal degree in co-relation 21532. Up to 3578 conditions per place. [2024-12-01 23:09:07,405 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 58 selfloop transitions, 14 changer transitions 0/205 dead transitions. [2024-12-01 23:09:07,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 205 transitions, 601 flow [2024-12-01 23:09:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2024-12-01 23:09:07,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272884283246977 [2024-12-01 23:09:07,408 INFO L175 Difference]: Start difference. First operand has 181 places, 172 transitions, 380 flow. Second operand 3 states and 479 transitions. [2024-12-01 23:09:07,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 205 transitions, 601 flow [2024-12-01 23:09:07,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 205 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-01 23:09:07,411 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 490 flow [2024-12-01 23:09:07,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2024-12-01 23:09:07,412 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 4 predicate places. [2024-12-01 23:09:07,413 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 490 flow [2024-12-01 23:09:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-12-01 23:09:07,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:07,413 INFO L206 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] [2024-12-01 23:09:07,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-01 23:09:07,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:07,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:07,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1799341899, now seen corresponding path program 1 times [2024-12-01 23:09:07,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:07,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624507948] [2024-12-01 23:09:07,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:07,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:07,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:07,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624507948] [2024-12-01 23:09:07,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624507948] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:07,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:07,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:07,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489625947] [2024-12-01 23:09:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:07,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:07,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:07,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:07,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-12-01 23:09:07,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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-12-01 23:09:07,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:07,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-12-01 23:09:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:08,831 INFO L124 PetriNetUnfolderBase]: 4151/16635 cut-off events. [2024-12-01 23:09:08,831 INFO L125 PetriNetUnfolderBase]: For 4322/4497 co-relation queries the response was YES. [2024-12-01 23:09:08,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27453 conditions, 16635 events. 4151/16635 cut-off events. For 4322/4497 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 195223 event pairs, 2411 based on Foata normal form. 46/15100 useless extension candidates. Maximal degree in co-relation 27445. Up to 5625 conditions per place. [2024-12-01 23:09:08,899 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 52 selfloop transitions, 14 changer transitions 0/210 dead transitions. [2024-12-01 23:09:08,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 210 transitions, 708 flow [2024-12-01 23:09:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-12-01 23:09:08,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8169257340241797 [2024-12-01 23:09:08,900 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 490 flow. Second operand 3 states and 473 transitions. [2024-12-01 23:09:08,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 210 transitions, 708 flow [2024-12-01 23:09:08,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 210 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:08,914 INFO L231 Difference]: Finished difference. Result has 182 places, 198 transitions, 588 flow [2024-12-01 23:09:08,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=182, PETRI_TRANSITIONS=198} [2024-12-01 23:09:08,915 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 6 predicate places. [2024-12-01 23:09:08,915 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 588 flow [2024-12-01 23:09:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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-12-01 23:09:08,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:08,916 INFO L206 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] [2024-12-01 23:09:08,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-01 23:09:08,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash -921122402, now seen corresponding path program 1 times [2024-12-01 23:09:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332279655] [2024-12-01 23:09:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-01 23:09:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332279655] [2024-12-01 23:09:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332279655] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39575694] [2024-12-01 23:09:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:09:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:09,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:09:09,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:09:09,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 193 [2024-12-01 23:09:09,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 198 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 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-12-01 23:09:09,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:09,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 193 [2024-12-01 23:09:09,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:10,920 INFO L124 PetriNetUnfolderBase]: 3472/19609 cut-off events. [2024-12-01 23:09:10,920 INFO L125 PetriNetUnfolderBase]: For 1962/2262 co-relation queries the response was YES. [2024-12-01 23:09:10,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28508 conditions, 19609 events. 3472/19609 cut-off events. For 1962/2262 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 254640 event pairs, 1482 based on Foata normal form. 21/17492 useless extension candidates. Maximal degree in co-relation 28499. Up to 3824 conditions per place. [2024-12-01 23:09:10,985 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 56 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2024-12-01 23:09:10,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 230 transitions, 774 flow [2024-12-01 23:09:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:09:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-01 23:09:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 932 transitions. [2024-12-01 23:09:10,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8048359240069085 [2024-12-01 23:09:10,987 INFO L175 Difference]: Start difference. First operand has 182 places, 198 transitions, 588 flow. Second operand 6 states and 932 transitions. [2024-12-01 23:09:10,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 230 transitions, 774 flow [2024-12-01 23:09:10,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 230 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:10,997 INFO L231 Difference]: Finished difference. Result has 188 places, 200 transitions, 586 flow [2024-12-01 23:09:10,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=586, PETRI_PLACES=188, PETRI_TRANSITIONS=200} [2024-12-01 23:09:10,998 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 12 predicate places. [2024-12-01 23:09:10,998 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 200 transitions, 586 flow [2024-12-01 23:09:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 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-12-01 23:09:10,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:10,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:10,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-01 23:09:10,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:10,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1539605248, now seen corresponding path program 1 times [2024-12-01 23:09:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:10,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344040248] [2024-12-01 23:09:10,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:10,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-01 23:09:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344040248] [2024-12-01 23:09:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344040248] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:11,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:11,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443263304] [2024-12-01 23:09:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:11,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:11,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:11,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-12-01 23:09:11,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 200 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-12-01 23:09:11,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:11,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-12-01 23:09:11,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:12,848 INFO L124 PetriNetUnfolderBase]: 4667/20052 cut-off events. [2024-12-01 23:09:12,849 INFO L125 PetriNetUnfolderBase]: For 5091/5298 co-relation queries the response was YES. [2024-12-01 23:09:12,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32612 conditions, 20052 events. 4667/20052 cut-off events. For 5091/5298 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 250157 event pairs, 2724 based on Foata normal form. 35/18010 useless extension candidates. Maximal degree in co-relation 32600. Up to 6276 conditions per place. [2024-12-01 23:09:12,930 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 59 selfloop transitions, 17 changer transitions 0/224 dead transitions. [2024-12-01 23:09:12,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 224 transitions, 821 flow [2024-12-01 23:09:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-12-01 23:09:12,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8151986183074266 [2024-12-01 23:09:12,931 INFO L175 Difference]: Start difference. First operand has 188 places, 200 transitions, 586 flow. Second operand 3 states and 472 transitions. [2024-12-01 23:09:12,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 224 transitions, 821 flow [2024-12-01 23:09:12,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 224 transitions, 815 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:12,936 INFO L231 Difference]: Finished difference. Result has 190 places, 213 transitions, 734 flow [2024-12-01 23:09:12,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=190, PETRI_TRANSITIONS=213} [2024-12-01 23:09:12,937 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 14 predicate places. [2024-12-01 23:09:12,937 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 213 transitions, 734 flow [2024-12-01 23:09:12,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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-12-01 23:09:12,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:12,937 INFO L206 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] [2024-12-01 23:09:12,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-01 23:09:12,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:12,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:12,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2114686338, now seen corresponding path program 1 times [2024-12-01 23:09:12,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:12,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054787702] [2024-12-01 23:09:12,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-01 23:09:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054787702] [2024-12-01 23:09:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054787702] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464836382] [2024-12-01 23:09:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:12,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:12,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:13,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 193 [2024-12-01 23:09:13,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 213 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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-12-01 23:09:13,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:13,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 193 [2024-12-01 23:09:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:15,364 INFO L124 PetriNetUnfolderBase]: 5232/22632 cut-off events. [2024-12-01 23:09:15,364 INFO L125 PetriNetUnfolderBase]: For 12806/13238 co-relation queries the response was YES. [2024-12-01 23:09:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39845 conditions, 22632 events. 5232/22632 cut-off events. For 12806/13238 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 288414 event pairs, 2912 based on Foata normal form. 50/20365 useless extension candidates. Maximal degree in co-relation 39832. Up to 7045 conditions per place. [2024-12-01 23:09:15,440 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 71 selfloop transitions, 17 changer transitions 0/238 dead transitions. [2024-12-01 23:09:15,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 238 transitions, 1028 flow [2024-12-01 23:09:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2024-12-01 23:09:15,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8169257340241797 [2024-12-01 23:09:15,441 INFO L175 Difference]: Start difference. First operand has 190 places, 213 transitions, 734 flow. Second operand 3 states and 473 transitions. [2024-12-01 23:09:15,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 238 transitions, 1028 flow [2024-12-01 23:09:15,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 238 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:09:15,464 INFO L231 Difference]: Finished difference. Result has 192 places, 226 transitions, 876 flow [2024-12-01 23:09:15,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=192, PETRI_TRANSITIONS=226} [2024-12-01 23:09:15,465 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 16 predicate places. [2024-12-01 23:09:15,465 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 226 transitions, 876 flow [2024-12-01 23:09:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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-12-01 23:09:15,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:15,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:15,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-01 23:09:15,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-12-01 23:09:15,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -304293297, now seen corresponding path program 1 times [2024-12-01 23:09:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750537951] [2024-12-01 23:09:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:09:15,489 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-01 23:09:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-01 23:09:15,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-01 23:09:15,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-01 23:09:15,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-12-01 23:09:15,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-12-01 23:09:15,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-12-01 23:09:15,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-12-01 23:09:15,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-12-01 23:09:15,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-12-01 23:09:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-01 23:09:15,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:09:15,512 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-01 23:09:15,512 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-01 23:09:15,540 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-01 23:09:15,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 242 transitions, 511 flow [2024-12-01 23:09:15,599 INFO L124 PetriNetUnfolderBase]: 62/532 cut-off events. [2024-12-01 23:09:15,599 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-12-01 23:09:15,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 532 events. 62/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2048 event pairs, 1 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 355. Up to 16 conditions per place. [2024-12-01 23:09:15,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 242 transitions, 511 flow [2024-12-01 23:09:15,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 242 transitions, 511 flow [2024-12-01 23:09:15,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-01 23:09:15,606 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;@49505c49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-01 23:09:15,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-12-01 23:09:15,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-01 23:09:15,609 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2024-12-01 23:09:15,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-01 23:09:15,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:15,609 INFO L206 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] [2024-12-01 23:09:15,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:09:15,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1832835041, now seen corresponding path program 1 times [2024-12-01 23:09:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:15,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951250537] [2024-12-01 23:09:15,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951250537] [2024-12-01 23:09:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951250537] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868053516] [2024-12-01 23:09:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-01 23:09:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:15,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-01 23:09:15,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-01 23:09:15,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 242 [2024-12-01 23:09:15,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 242 transitions, 511 flow. Second operand has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 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-12-01 23:09:15,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:15,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 242 [2024-12-01 23:09:15,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:17,524 INFO L124 PetriNetUnfolderBase]: 4833/20255 cut-off events. [2024-12-01 23:09:17,524 INFO L125 PetriNetUnfolderBase]: For 940/940 co-relation queries the response was YES. [2024-12-01 23:09:17,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27680 conditions, 20255 events. 4833/20255 cut-off events. For 940/940 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 243222 event pairs, 4795 based on Foata normal form. 5465/23774 useless extension candidates. Maximal degree in co-relation 23268. Up to 6995 conditions per place. [2024-12-01 23:09:17,774 INFO L140 encePairwiseOnDemand]: 217/242 looper letters, 28 selfloop transitions, 0 changer transitions 0/215 dead transitions. [2024-12-01 23:09:17,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 513 flow [2024-12-01 23:09:17,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-01 23:09:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-12-01 23:09:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 429 transitions. [2024-12-01 23:09:17,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2024-12-01 23:09:17,775 INFO L175 Difference]: Start difference. First operand has 220 places, 242 transitions, 511 flow. Second operand 2 states and 429 transitions. [2024-12-01 23:09:17,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 513 flow [2024-12-01 23:09:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:17,779 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 457 flow [2024-12-01 23:09:17,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-12-01 23:09:17,779 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, -1 predicate places. [2024-12-01 23:09:17,779 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 457 flow [2024-12-01 23:09:17,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 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-12-01 23:09:17,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:17,780 INFO L206 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] [2024-12-01 23:09:17,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-01 23:09:17,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:09:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -446295104, now seen corresponding path program 1 times [2024-12-01 23:09:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:17,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077298728] [2024-12-01 23:09:17,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:17,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:17,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077298728] [2024-12-01 23:09:17,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077298728] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:17,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:17,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-01 23:09:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672510281] [2024-12-01 23:09:17,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:17,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:17,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:17,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:17,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:17,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 242 [2024-12-01 23:09:17,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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-12-01 23:09:17,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:17,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 242 [2024-12-01 23:09:17,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:21,725 INFO L124 PetriNetUnfolderBase]: 8969/35501 cut-off events. [2024-12-01 23:09:21,725 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2024-12-01 23:09:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48740 conditions, 35501 events. 8969/35501 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 459318 event pairs, 8324 based on Foata normal form. 1/32093 useless extension candidates. Maximal degree in co-relation 48734. Up to 12802 conditions per place. [2024-12-01 23:09:21,884 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 39 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-12-01 23:09:21,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 222 transitions, 553 flow [2024-12-01 23:09:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2024-12-01 23:09:21,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099173553719008 [2024-12-01 23:09:21,886 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 457 flow. Second operand 3 states and 588 transitions. [2024-12-01 23:09:21,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 222 transitions, 553 flow [2024-12-01 23:09:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-01 23:09:21,889 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 469 flow [2024-12-01 23:09:21,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2024-12-01 23:09:21,889 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 2 predicate places. [2024-12-01 23:09:21,889 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 469 flow [2024-12-01 23:09:21,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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-12-01 23:09:21,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:21,890 INFO L206 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] [2024-12-01 23:09:21,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-01 23:09:21,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:09:21,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash 315956949, now seen corresponding path program 1 times [2024-12-01 23:09:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297935305] [2024-12-01 23:09:21,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297935305] [2024-12-01 23:09:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297935305] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:09:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144108099] [2024-12-01 23:09:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-01 23:09:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:22,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-01 23:09:22,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-12-01 23:09:22,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 242 [2024-12-01 23:09:22,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 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-12-01 23:09:22,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:22,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 242 [2024-12-01 23:09:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:29,018 INFO L124 PetriNetUnfolderBase]: 19695/66079 cut-off events. [2024-12-01 23:09:29,018 INFO L125 PetriNetUnfolderBase]: For 1507/1507 co-relation queries the response was YES. [2024-12-01 23:09:29,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95005 conditions, 66079 events. 19695/66079 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 892595 event pairs, 7382 based on Foata normal form. 0/60325 useless extension candidates. Maximal degree in co-relation 94997. Up to 20118 conditions per place. [2024-12-01 23:09:29,349 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 112 selfloop transitions, 6 changer transitions 0/287 dead transitions. [2024-12-01 23:09:29,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 287 transitions, 847 flow [2024-12-01 23:09:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:09:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-01 23:09:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2024-12-01 23:09:29,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837465564738292 [2024-12-01 23:09:29,486 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 469 flow. Second operand 6 states and 1138 transitions. [2024-12-01 23:09:29,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 287 transitions, 847 flow [2024-12-01 23:09:29,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 287 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-01 23:09:29,491 INFO L231 Difference]: Finished difference. Result has 225 places, 215 transitions, 477 flow [2024-12-01 23:09:29,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=225, PETRI_TRANSITIONS=215} [2024-12-01 23:09:29,492 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 5 predicate places. [2024-12-01 23:09:29,492 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 215 transitions, 477 flow [2024-12-01 23:09:29,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 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-12-01 23:09:29,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:29,492 INFO L206 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] [2024-12-01 23:09:29,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-01 23:09:29,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:09:29,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash -327591134, now seen corresponding path program 1 times [2024-12-01 23:09:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:29,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76119134] [2024-12-01 23:09:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76119134] [2024-12-01 23:09:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76119134] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:29,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:29,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:29,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676726170] [2024-12-01 23:09:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:29,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:29,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:29,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:29,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 242 [2024-12-01 23:09:29,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 215 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-01 23:09:29,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:29,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 242 [2024-12-01 23:09:29,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:09:55,409 INFO L124 PetriNetUnfolderBase]: 108050/275917 cut-off events. [2024-12-01 23:09:55,409 INFO L125 PetriNetUnfolderBase]: For 6265/6265 co-relation queries the response was YES. [2024-12-01 23:09:56,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431887 conditions, 275917 events. 108050/275917 cut-off events. For 6265/6265 co-relation queries the response was YES. Maximal size of possible extension queue 5790. Compared 4002185 event pairs, 45980 based on Foata normal form. 0/245037 useless extension candidates. Maximal degree in co-relation 431879. Up to 82478 conditions per place. [2024-12-01 23:09:56,837 INFO L140 encePairwiseOnDemand]: 215/242 looper letters, 82 selfloop transitions, 20 changer transitions 0/262 dead transitions. [2024-12-01 23:09:56,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 262 transitions, 796 flow [2024-12-01 23:09:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:09:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:09:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2024-12-01 23:09:56,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8154269972451791 [2024-12-01 23:09:56,838 INFO L175 Difference]: Start difference. First operand has 225 places, 215 transitions, 477 flow. Second operand 3 states and 592 transitions. [2024-12-01 23:09:56,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 262 transitions, 796 flow [2024-12-01 23:09:56,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 262 transitions, 784 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-12-01 23:09:56,847 INFO L231 Difference]: Finished difference. Result has 224 places, 235 transitions, 639 flow [2024-12-01 23:09:56,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=224, PETRI_TRANSITIONS=235} [2024-12-01 23:09:56,848 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 4 predicate places. [2024-12-01 23:09:56,848 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 235 transitions, 639 flow [2024-12-01 23:09:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-01 23:09:56,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:09:56,848 INFO L206 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] [2024-12-01 23:09:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-01 23:09:56,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:09:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:09:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1310916170, now seen corresponding path program 1 times [2024-12-01 23:09:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:09:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884576769] [2024-12-01 23:09:56,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:09:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:09:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:09:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:09:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:09:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884576769] [2024-12-01 23:09:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884576769] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:09:56,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:09:56,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:09:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658683299] [2024-12-01 23:09:56,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:09:56,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:09:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:09:56,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:09:56,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:09:56,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 242 [2024-12-01 23:09:56,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 235 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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-12-01 23:09:56,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:09:56,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 242 [2024-12-01 23:09:56,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:10:29,053 INFO L124 PetriNetUnfolderBase]: 109093/320635 cut-off events. [2024-12-01 23:10:29,053 INFO L125 PetriNetUnfolderBase]: For 114314/121624 co-relation queries the response was YES. [2024-12-01 23:10:30,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580993 conditions, 320635 events. 109093/320635 cut-off events. For 114314/121624 co-relation queries the response was YES. Maximal size of possible extension queue 6564. Compared 5071040 event pairs, 67444 based on Foata normal form. 977/290911 useless extension candidates. Maximal degree in co-relation 580984. Up to 128862 conditions per place. [2024-12-01 23:10:31,065 INFO L140 encePairwiseOnDemand]: 229/242 looper letters, 76 selfloop transitions, 22 changer transitions 0/275 dead transitions. [2024-12-01 23:10:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 275 transitions, 987 flow [2024-12-01 23:10:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-01 23:10:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-01 23:10:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2024-12-01 23:10:31,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8126721763085399 [2024-12-01 23:10:31,067 INFO L175 Difference]: Start difference. First operand has 224 places, 235 transitions, 639 flow. Second operand 3 states and 590 transitions. [2024-12-01 23:10:31,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 275 transitions, 987 flow [2024-12-01 23:10:31,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 275 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:10:31,234 INFO L231 Difference]: Finished difference. Result has 226 places, 255 transitions, 805 flow [2024-12-01 23:10:31,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=226, PETRI_TRANSITIONS=255} [2024-12-01 23:10:31,234 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 6 predicate places. [2024-12-01 23:10:31,234 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 255 transitions, 805 flow [2024-12-01 23:10:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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-12-01 23:10:31,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:10:31,235 INFO L206 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] [2024-12-01 23:10:31,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-01 23:10:31,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:10:31,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:10:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -444855983, now seen corresponding path program 1 times [2024-12-01 23:10:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:10:31,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014928437] [2024-12-01 23:10:31,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:10:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:10:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:10:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:10:31,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:10:31,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014928437] [2024-12-01 23:10:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014928437] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:10:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:10:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-01 23:10:31,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892354086] [2024-12-01 23:10:31,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:10:31,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-01 23:10:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:10:31,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-01 23:10:31,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-01 23:10:31,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 242 [2024-12-01 23:10:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 255 transitions, 805 flow. Second operand has 5 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 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-12-01 23:10:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:10:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 242 [2024-12-01 23:10:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:10:36,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][169], [130#L701-26true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 173#L701-11true, 219#true, 217#true, Black: 235#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 245#true, 223#true]) [2024-12-01 23:10:36,954 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-12-01 23:10:36,955 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-12-01 23:10:36,955 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-12-01 23:10:36,955 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-12-01 23:10:38,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][255], [201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 28#L701-6true, 245#true, 223#true]) [2024-12-01 23:10:38,547 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,547 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,547 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,547 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 160#L701-25true, 58#L701-6true, 245#true, 223#true]) [2024-12-01 23:10:38,561 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,561 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,561 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:38,561 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:10:39,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 210#L701-5true, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 160#L701-25true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:39,397 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,397 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,397 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,397 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, Black: 235#true, 217#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 22#L701-13true, 245#true, 58#L701-6true, 223#true]) [2024-12-01 23:10:39,811 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,811 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,811 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:39,811 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-12-01 23:10:40,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 160#L701-25true, 22#L701-13true, 245#true, 58#L701-6true, 223#true]) [2024-12-01 23:10:40,253 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,253 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,253 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,253 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 22#L701-13true, 58#L701-6true, 245#true, 223#true]) [2024-12-01 23:10:40,253 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,254 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,254 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,254 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:10:40,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][198], [201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:40,883 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2024-12-01 23:10:40,883 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:10:40,883 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:10:40,883 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:10:40,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][129], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, 217#true, Black: 235#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:40,884 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-12-01 23:10:40,884 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:10:40,884 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:10:40,884 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [240#true, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 160#L701-25true, 221#true, 245#true, 223#true]) [2024-12-01 23:10:45,794 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 235#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 160#L701-25true, 245#true, 223#true]) [2024-12-01 23:10:45,794 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:45,794 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:10:46,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 160#L701-25true, 245#true, 223#true]) [2024-12-01 23:10:46,306 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,306 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,306 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,306 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [130#L701-26true, 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 245#true, 223#true]) [2024-12-01 23:10:46,320 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,320 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,320 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:46,320 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:10:47,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][129], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, 217#true, Black: 235#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 160#L701-25true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:47,462 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,462 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][129], [240#true, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 166#L701-26true, 219#true, 217#true, Black: 235#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:47,463 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,463 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-12-01 23:10:47,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][169], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, 5#L701-30true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 245#true, 223#true]) [2024-12-01 23:10:47,631 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-12-01 23:10:47,631 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:10:47,631 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:10:47,631 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:10:48,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([803] L709-3-->L709-4: Formula: (= |v_#race~global~0_1| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_1|} AuxVars[] AssignedVars[#race~global~0][129], [130#L701-26true, 240#true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 166#L701-26true, 219#true, Black: 235#true, 217#true, 34#L709-4true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:48,033 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,033 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,033 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,033 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][262], [130#L701-26true, 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 22#L701-13true, 245#true, 223#true]) [2024-12-01 23:10:48,743 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,743 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,743 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:48,743 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:10:50,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][248], [201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 8#L701-30true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 245#true, 223#true]) [2024-12-01 23:10:50,388 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-12-01 23:10:50,388 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:10:50,388 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:10:50,388 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-12-01 23:11:04,806 INFO L124 PetriNetUnfolderBase]: 80797/321397 cut-off events. [2024-12-01 23:11:04,806 INFO L125 PetriNetUnfolderBase]: For 38332/71460 co-relation queries the response was YES. [2024-12-01 23:11:05,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489110 conditions, 321397 events. 80797/321397 cut-off events. For 38332/71460 co-relation queries the response was YES. Maximal size of possible extension queue 7316. Compared 5774072 event pairs, 31222 based on Foata normal form. 93/280143 useless extension candidates. Maximal degree in co-relation 489100. Up to 82724 conditions per place. [2024-12-01 23:11:07,003 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 66 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2024-12-01 23:11:07,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 289 transitions, 1017 flow [2024-12-01 23:11:07,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-01 23:11:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-01 23:11:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1152 transitions. [2024-12-01 23:11:07,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933884297520661 [2024-12-01 23:11:07,005 INFO L175 Difference]: Start difference. First operand has 226 places, 255 transitions, 805 flow. Second operand 6 states and 1152 transitions. [2024-12-01 23:11:07,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 289 transitions, 1017 flow [2024-12-01 23:11:07,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 289 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-01 23:11:07,438 INFO L231 Difference]: Finished difference. Result has 232 places, 258 transitions, 793 flow [2024-12-01 23:11:07,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=793, PETRI_PLACES=232, PETRI_TRANSITIONS=258} [2024-12-01 23:11:07,439 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 12 predicate places. [2024-12-01 23:11:07,439 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 258 transitions, 793 flow [2024-12-01 23:11:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 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-12-01 23:11:07,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-01 23:11:07,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-01 23:11:07,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-01 23:11:07,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-12-01 23:11:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-01 23:11:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1883452389, now seen corresponding path program 1 times [2024-12-01 23:11:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-01 23:11:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035329391] [2024-12-01 23:11:07,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-01 23:11:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-01 23:11:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-01 23:11:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-01 23:11:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-01 23:11:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035329391] [2024-12-01 23:11:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035329391] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-01 23:11:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-01 23:11:07,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-01 23:11:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120693917] [2024-12-01 23:11:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-01 23:11:07,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-01 23:11:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-01 23:11:07,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-01 23:11:07,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-01 23:11:07,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 242 [2024-12-01 23:11:07,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 258 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-12-01 23:11:07,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-01 23:11:07,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 242 [2024-12-01 23:11:07,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-01 23:11:15,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L701-4-->L701-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][180], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, Black: 235#true, 203#L709-11true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 165#L701-5true, 221#true, 257#true, 22#L701-13true, 245#true, 58#L701-6true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:15,977 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is not cut-off event [2024-12-01 23:11:15,977 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-12-01 23:11:15,977 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-12-01 23:11:15,977 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-12-01 23:11:17,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:17,355 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,355 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,355 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,355 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:17,359 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:17,359 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 215#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:17,359 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,359 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:17,360 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L701-4-->L701-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][180], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 165#L701-5true, 221#true, 257#true, 22#L701-13true, 245#true, 58#L701-6true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:18,012 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2024-12-01 23:11:18,012 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-12-01 23:11:18,013 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-12-01 23:11:18,013 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-12-01 23:11:18,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:18,164 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-12-01 23:11:18,164 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:18,164 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:18,164 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-12-01 23:11:18,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:18,685 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2024-12-01 23:11:18,685 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-12-01 23:11:18,685 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-12-01 23:11:18,685 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-12-01 23:11:18,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 28#L701-6true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:18,690 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:18,690 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:18,690 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-12-01 23:11:19,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 215#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:19,530 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event [2024-12-01 23:11:19,530 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-12-01 23:11:19,530 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-12-01 23:11:19,530 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-12-01 23:11:19,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][282], [60#L701-11true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:19,588 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-12-01 23:11:19,588 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-12-01 23:11:19,588 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-12-01 23:11:19,588 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-12-01 23:11:20,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:20,398 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-12-01 23:11:20,398 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:20,399 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:20,399 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:20,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 96#L701-23true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:20,412 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-12-01 23:11:20,412 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:20,412 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:20,412 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-12-01 23:11:21,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 141#L709-5true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:21,252 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2024-12-01 23:11:21,252 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:11:21,252 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:11:21,252 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-12-01 23:11:21,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][248], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 60#L701-11true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 22#L701-13true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:21,742 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,742 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,742 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,742 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 189#L701-13true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:21,873 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:21,873 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][282], [60#L701-11true, 75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:21,931 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,931 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,931 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:21,931 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-12-01 23:11:22,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][224], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:22,648 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is not cut-off event [2024-12-01 23:11:22,648 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-12-01 23:11:22,648 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-12-01 23:11:22,648 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-12-01 23:11:22,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:22,700 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,700 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,700 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,700 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,763 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:22,763 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,763 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,763 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,763 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,763 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:22,764 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,764 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,764 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:22,764 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:23,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 203#L709-11true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:23,396 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,396 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,396 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,396 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 189#L701-13true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:23,403 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-12-01 23:11:23,403 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-12-01 23:11:23,403 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-12-01 23:11:23,403 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-12-01 23:11:23,636 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 203#L709-11true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:23,636 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,636 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,636 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,636 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:23,637 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:24,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][248], [60#L701-11true, 75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 22#L701-13true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:24,107 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,107 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,107 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,107 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 235#true, 217#true, 203#L709-11true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 28#L701-6true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:24,241 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-12-01 23:11:24,241 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:24,241 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:24,241 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-12-01 23:11:24,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 203#L709-11true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:24,242 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-12-01 23:11:24,243 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-12-01 23:11:24,243 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-12-01 23:11:24,243 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-12-01 23:11:24,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 189#L701-13true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:24,245 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,245 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,245 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,245 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:24,246 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:24,246 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-12-01 23:11:24,246 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:24,246 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:24,246 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:24,246 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-12-01 23:11:25,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 160#L701-25true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:25,065 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-12-01 23:11:25,065 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:25,065 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:25,065 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-12-01 23:11:25,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:25,145 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,145 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,145 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,145 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,218 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][247], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:25,218 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,218 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,218 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,218 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,218 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-12-01 23:11:25,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][224], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 121#L701-16true, Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:25,964 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-12-01 23:11:25,964 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:25,964 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:25,964 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:26,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,028 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,028 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,028 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,028 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 189#L701-13true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,033 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-12-01 23:11:26,033 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:26,033 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:26,033 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-12-01 23:11:26,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 28#L701-6true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,085 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,085 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,085 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,085 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,085 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 75#L710-2true, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 28#L701-6true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,942 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,942 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,942 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,942 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-12-01 23:11:26,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, 203#L709-11true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,943 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,943 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,943 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,943 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [75#L710-2true, Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:26,949 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,949 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,949 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:26,949 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-12-01 23:11:27,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][272], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 160#L701-25true, 221#true, 96#L701-23true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:27,572 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-12-01 23:11:27,572 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-12-01 23:11:27,572 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-12-01 23:11:27,572 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-12-01 23:11:28,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][224], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 89#L701-23true, Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:28,480 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-12-01 23:11:28,480 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-12-01 23:11:28,480 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-12-01 23:11:28,480 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-12-01 23:11:28,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 152#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:28,542 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,542 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,542 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,542 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] L701-29-->L701-30: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][287], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 5#L701-30true, 208#L701-16true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:28,545 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-12-01 23:11:28,545 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:11:28,545 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:11:28,545 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-12-01 23:11:28,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][269], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 166#L701-26true, 173#L701-11true, 219#true, Black: 235#true, 217#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:28,573 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,573 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,573 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:28,573 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-12-01 23:11:29,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L701-9-->L701-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][176], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 75#L710-2true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 61#L701-10true, 96#L701-23true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:29,459 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is not cut-off event [2024-12-01 23:11:29,459 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-12-01 23:11:29,459 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-12-01 23:11:29,459 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-12-01 23:11:31,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L701-24-->L701-25: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][193], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 37#L701-25true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 157#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 152#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 219#true, 217#true, Black: 235#true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 141#L709-5true, 221#true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:31,006 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-12-01 23:11:31,006 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-12-01 23:11:31,006 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-12-01 23:11:31,006 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-12-01 23:11:31,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] L701-29-->L701-30: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][287], [Black: 249#(<= |ULTIMATE.start_main_~i~0#1| 1), 201#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L701-11true, 219#true, 217#true, Black: 237#(= |#race~global~0| 0), 5#L701-30true, Black: 242#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 221#true, 96#L701-23true, 257#true, 245#true, 223#true, Black: 253#(and (= 0 |ULTIMATE.start_main_#t~post16#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 247#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2024-12-01 23:11:31,030 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-12-01 23:11:31,030 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:11:31,030 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-12-01 23:11:31,030 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event