./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU --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 3787427d85789c6543b359d801a5f9325d8405a4b765c9b89d348aba34fa2c55 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:14,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:15,048 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:19:15,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:15,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:15,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:15,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:15,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:15,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:15,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:15,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:15,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:15,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:15,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:15,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:15,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:15,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:15,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:15,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:15,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:15,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:15,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:15,114 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:19:15,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:15,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:19:15,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:15,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:15,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:15,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:15,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:15,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:15,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:15,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:15,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:15,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:15,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:15,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:15,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:15,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:15,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:15,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:15,123 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 3787427d85789c6543b359d801a5f9325d8405a4b765c9b89d348aba34fa2c55 [2024-10-31 22:19:15,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:15,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:15,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:15,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:15,508 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:15,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i Unable to find full path for "g++" [2024-10-31 22:19:17,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:18,153 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:18,154 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask.i [2024-10-31 22:19:18,182 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/data/899863702/c0905a12f8384250bcb8bb3ceb90a946/FLAG9ea0a97d8 [2024-10-31 22:19:18,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/data/899863702/c0905a12f8384250bcb8bb3ceb90a946 [2024-10-31 22:19:18,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:18,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:18,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:18,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:18,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:18,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582709f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:18, skipping insertion in model container [2024-10-31 22:19:18,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:18" (1/1) ... [2024-10-31 22:19:18,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:19,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:19,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:19,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:19,228 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:19,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19 WrapperNode [2024-10-31 22:19:19,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:19,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:19,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:19,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:19,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,332 INFO L138 Inliner]: procedures = 277, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2024-10-31 22:19:19,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:19,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:19,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:19,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:19,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:19,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:19,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:19,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:19,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (1/1) ... [2024-10-31 22:19:19,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:19,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:19,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:19,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dea7f79f-1549-466e-b1b3-6362eb59bf1c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:19:19,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:19:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:19:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:19:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:19:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:19:19,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:19,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:19:19,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 22:19:19,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 22:19:19,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:19,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:19,514 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:19:19,755 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:19,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:20,322 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:19:20,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:20,368 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:20,369 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:19:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:20 BoogieIcfgContainer [2024-10-31 22:19:20,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:20,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:20,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:20,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:20,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:18" (1/3) ... [2024-10-31 22:19:20,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43eb838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:20, skipping insertion in model container [2024-10-31 22:19:20,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:19" (2/3) ... [2024-10-31 22:19:20,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43eb838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:20, skipping insertion in model container [2024-10-31 22:19:20,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:20" (3/3) ... [2024-10-31 22:19:20,386 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask.i [2024-10-31 22:19:20,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:20,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-31 22:19:20,403 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:19:20,479 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-31 22:19:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 202 transitions, 411 flow [2024-10-31 22:19:20,728 INFO L124 PetriNetUnfolderBase]: 30/300 cut-off events. [2024-10-31 22:19:20,728 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:19:20,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 30/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-31 22:19:20,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 202 transitions, 411 flow [2024-10-31 22:19:20,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 202 transitions, 411 flow [2024-10-31 22:19:20,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:20,759 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;@4f7db848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:20,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-31 22:19:20,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:19:20,773 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-31 22:19:20,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:19:20,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:20,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:20,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:20,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1455706932, now seen corresponding path program 1 times [2024-10-31 22:19:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754933246] [2024-10-31 22:19:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754933246] [2024-10-31 22:19:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754933246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134553016] [2024-10-31 22:19:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202 [2024-10-31 22:19:21,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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-10-31 22:19:21,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:21,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202 [2024-10-31 22:19:21,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:21,530 INFO L124 PetriNetUnfolderBase]: 115/750 cut-off events. [2024-10-31 22:19:21,531 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:19:21,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 750 events. 115/750 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3680 event pairs, 17 based on Foata normal form. 10/622 useless extension candidates. Maximal degree in co-relation 712. Up to 122 conditions per place. [2024-10-31 22:19:21,543 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 19 selfloop transitions, 2 changer transitions 2/197 dead transitions. [2024-10-31 22:19:21,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 443 flow [2024-10-31 22:19:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-10-31 22:19:21,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9141914191419142 [2024-10-31 22:19:21,565 INFO L175 Difference]: Start difference. First operand has 187 places, 202 transitions, 411 flow. Second operand 3 states and 554 transitions. [2024-10-31 22:19:21,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 443 flow [2024-10-31 22:19:21,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 197 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:21,574 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 401 flow [2024-10-31 22:19:21,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2024-10-31 22:19:21,582 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-31 22:19:21,582 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 401 flow [2024-10-31 22:19:21,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 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-10-31 22:19:21,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:21,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:21,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:21,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 66535494, now seen corresponding path program 1 times [2024-10-31 22:19:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153978092] [2024-10-31 22:19:21,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153978092] [2024-10-31 22:19:21,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153978092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769993385] [2024-10-31 22:19:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:19:21,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-10-31 22:19:21,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:21,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:19:21,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:22,071 INFO L124 PetriNetUnfolderBase]: 200/978 cut-off events. [2024-10-31 22:19:22,071 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:19:22,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 978 events. 200/978 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5281 event pairs, 21 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1190. Up to 146 conditions per place. [2024-10-31 22:19:22,080 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 35 selfloop transitions, 8 changer transitions 0/214 dead transitions. [2024-10-31 22:19:22,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 214 transitions, 525 flow [2024-10-31 22:19:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2024-10-31 22:19:22,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372937293729373 [2024-10-31 22:19:22,084 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 401 flow. Second operand 3 states and 568 transitions. [2024-10-31 22:19:22,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 214 transitions, 525 flow [2024-10-31 22:19:22,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 214 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:22,097 INFO L231 Difference]: Finished difference. Result has 188 places, 203 transitions, 467 flow [2024-10-31 22:19:22,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=188, PETRI_TRANSITIONS=203} [2024-10-31 22:19:22,101 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-31 22:19:22,101 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 203 transitions, 467 flow [2024-10-31 22:19:22,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-10-31 22:19:22,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:22,102 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:22,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:22,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:22,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1209265366, now seen corresponding path program 1 times [2024-10-31 22:19:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629401505] [2024-10-31 22:19:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629401505] [2024-10-31 22:19:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629401505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044648538] [2024-10-31 22:19:22,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 202 [2024-10-31 22:19:22,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 203 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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-10-31 22:19:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 202 [2024-10-31 22:19:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:22,503 INFO L124 PetriNetUnfolderBase]: 169/1030 cut-off events. [2024-10-31 22:19:22,504 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-31 22:19:22,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 1030 events. 169/1030 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5939 event pairs, 21 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1145. Up to 145 conditions per place. [2024-10-31 22:19:22,511 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 25 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-10-31 22:19:22,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 210 transitions, 535 flow [2024-10-31 22:19:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2024-10-31 22:19:22,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.929042904290429 [2024-10-31 22:19:22,515 INFO L175 Difference]: Start difference. First operand has 188 places, 203 transitions, 467 flow. Second operand 3 states and 563 transitions. [2024-10-31 22:19:22,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 210 transitions, 535 flow [2024-10-31 22:19:22,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 210 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:22,523 INFO L231 Difference]: Finished difference. Result has 187 places, 203 transitions, 461 flow [2024-10-31 22:19:22,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=187, PETRI_TRANSITIONS=203} [2024-10-31 22:19:22,524 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-10-31 22:19:22,525 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 203 transitions, 461 flow [2024-10-31 22:19:22,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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-10-31 22:19:22,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:22,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:22,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:22,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1080239920, now seen corresponding path program 1 times [2024-10-31 22:19:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912756295] [2024-10-31 22:19:22,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912756295] [2024-10-31 22:19:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912756295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001486343] [2024-10-31 22:19:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:22,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:22,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:19:22,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 203 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 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-10-31 22:19:22,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:22,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:19:22,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:23,174 INFO L124 PetriNetUnfolderBase]: 183/1034 cut-off events. [2024-10-31 22:19:23,174 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:19:23,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1034 events. 183/1034 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5871 event pairs, 34 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1130. Up to 166 conditions per place. [2024-10-31 22:19:23,181 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 33 selfloop transitions, 2 changer transitions 5/219 dead transitions. [2024-10-31 22:19:23,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 219 transitions, 573 flow [2024-10-31 22:19:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2024-10-31 22:19:23,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8952145214521452 [2024-10-31 22:19:23,185 INFO L175 Difference]: Start difference. First operand has 187 places, 203 transitions, 461 flow. Second operand 6 states and 1085 transitions. [2024-10-31 22:19:23,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 219 transitions, 573 flow [2024-10-31 22:19:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 219 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:23,191 INFO L231 Difference]: Finished difference. Result has 196 places, 203 transitions, 479 flow [2024-10-31 22:19:23,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=196, PETRI_TRANSITIONS=203} [2024-10-31 22:19:23,192 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-31 22:19:23,192 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 203 transitions, 479 flow [2024-10-31 22:19:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 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-10-31 22:19:23,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:23,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:23,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 598568740, now seen corresponding path program 1 times [2024-10-31 22:19:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:23,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611511067] [2024-10-31 22:19:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:23,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611511067] [2024-10-31 22:19:23,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611511067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:23,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:23,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349022428] [2024-10-31 22:19:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:23,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:23,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 202 [2024-10-31 22:19:23,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 203 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 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-10-31 22:19:23,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:23,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 202 [2024-10-31 22:19:23,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:23,554 INFO L124 PetriNetUnfolderBase]: 162/901 cut-off events. [2024-10-31 22:19:23,554 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-31 22:19:23,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 901 events. 162/901 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4665 event pairs, 29 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 1078. Up to 142 conditions per place. [2024-10-31 22:19:23,561 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 22 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-10-31 22:19:23,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 210 transitions, 541 flow [2024-10-31 22:19:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2024-10-31 22:19:23,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372937293729373 [2024-10-31 22:19:23,563 INFO L175 Difference]: Start difference. First operand has 196 places, 203 transitions, 479 flow. Second operand 3 states and 568 transitions. [2024-10-31 22:19:23,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 210 transitions, 541 flow [2024-10-31 22:19:23,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 210 transitions, 527 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:19:23,569 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 477 flow [2024-10-31 22:19:23,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2024-10-31 22:19:23,570 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2024-10-31 22:19:23,570 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 477 flow [2024-10-31 22:19:23,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 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-10-31 22:19:23,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:23,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:23,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:23,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:23,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash 791856797, now seen corresponding path program 1 times [2024-10-31 22:19:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808672202] [2024-10-31 22:19:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:23,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808672202] [2024-10-31 22:19:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808672202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250135596] [2024-10-31 22:19:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:23,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:19:23,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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-10-31 22:19:23,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:23,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:19:23,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:23,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 135#L1062-14true, Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:19:23,961 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-31 22:19:23,961 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:19:23,961 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:19:23,961 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:19:23,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L1062-19true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:19:23,979 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-31 22:19:23,980 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:19:23,980 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:19:23,980 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:19:24,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 44#L1062-27true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:19:24,014 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-31 22:19:24,014 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:19:24,014 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:19:24,014 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:24,145 INFO L124 PetriNetUnfolderBase]: 379/1614 cut-off events. [2024-10-31 22:19:24,145 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-31 22:19:24,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 1614 events. 379/1614 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11024 event pairs, 55 based on Foata normal form. 1/1414 useless extension candidates. Maximal degree in co-relation 2127. Up to 219 conditions per place. [2024-10-31 22:19:24,156 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 49 selfloop transitions, 12 changer transitions 0/237 dead transitions. [2024-10-31 22:19:24,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 237 transitions, 667 flow [2024-10-31 22:19:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2024-10-31 22:19:24,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232673267326733 [2024-10-31 22:19:24,159 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 477 flow. Second operand 4 states and 746 transitions. [2024-10-31 22:19:24,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 237 transitions, 667 flow [2024-10-31 22:19:24,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 237 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:24,165 INFO L231 Difference]: Finished difference. Result has 196 places, 214 transitions, 567 flow [2024-10-31 22:19:24,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2024-10-31 22:19:24,166 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-31 22:19:24,166 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 214 transitions, 567 flow [2024-10-31 22:19:24,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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-10-31 22:19:24,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:24,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:24,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:24,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:24,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash 58700373, now seen corresponding path program 1 times [2024-10-31 22:19:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557916258] [2024-10-31 22:19:24,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557916258] [2024-10-31 22:19:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557916258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:24,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400826586] [2024-10-31 22:19:24,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:24,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:24,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:19:24,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 214 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:24,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:24,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:19:24,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:24,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 193#true, 224#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 217#true, Black: 219#(not (= ~threads_mask~0 0)), 188#true, 119#L1063-10true]) [2024-10-31 22:19:24,570 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-31 22:19:24,571 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:19:24,571 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:19:24,571 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:19:24,678 INFO L124 PetriNetUnfolderBase]: 386/1593 cut-off events. [2024-10-31 22:19:24,679 INFO L125 PetriNetUnfolderBase]: For 479/593 co-relation queries the response was YES. [2024-10-31 22:19:24,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 1593 events. 386/1593 cut-off events. For 479/593 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10738 event pairs, 52 based on Foata normal form. 23/1423 useless extension candidates. Maximal degree in co-relation 2414. Up to 226 conditions per place. [2024-10-31 22:19:24,689 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 49 selfloop transitions, 13 changer transitions 0/238 dead transitions. [2024-10-31 22:19:24,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 238 transitions, 753 flow [2024-10-31 22:19:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2024-10-31 22:19:24,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207920792079208 [2024-10-31 22:19:24,691 INFO L175 Difference]: Start difference. First operand has 196 places, 214 transitions, 567 flow. Second operand 4 states and 744 transitions. [2024-10-31 22:19:24,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 238 transitions, 753 flow [2024-10-31 22:19:24,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 238 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:24,697 INFO L231 Difference]: Finished difference. Result has 201 places, 217 transitions, 626 flow [2024-10-31 22:19:24,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=201, PETRI_TRANSITIONS=217} [2024-10-31 22:19:24,698 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 14 predicate places. [2024-10-31 22:19:24,699 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 217 transitions, 626 flow [2024-10-31 22:19:24,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:24,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:24,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:24,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 918543710, now seen corresponding path program 1 times [2024-10-31 22:19:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408024454] [2024-10-31 22:19:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:24,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408024454] [2024-10-31 22:19:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408024454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:24,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:24,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:24,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141597072] [2024-10-31 22:19:24,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:24,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:24,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:24,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:19:24,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 217 transitions, 626 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:24,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:24,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:19:24,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:25,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 119#L1063-10true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,088 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-31 22:19:25,088 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:19:25,088 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:19:25,089 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:19:25,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,092 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:25,093 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:25,093 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:25,093 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:25,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 125#L1063-16true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,106 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2024-10-31 22:19:25,106 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:19:25,106 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:25,106 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:19:25,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 93#L1063-20true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,146 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-31 22:19:25,146 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:19:25,146 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:19:25,147 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:19:25,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 156#L1064-3true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,167 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-31 22:19:25,168 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:19:25,168 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:19:25,168 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:19:25,225 INFO L124 PetriNetUnfolderBase]: 431/1736 cut-off events. [2024-10-31 22:19:25,226 INFO L125 PetriNetUnfolderBase]: For 1136/1267 co-relation queries the response was YES. [2024-10-31 22:19:25,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3158 conditions, 1736 events. 431/1736 cut-off events. For 1136/1267 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11963 event pairs, 60 based on Foata normal form. 22/1539 useless extension candidates. Maximal degree in co-relation 2930. Up to 278 conditions per place. [2024-10-31 22:19:25,238 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 47 selfloop transitions, 15 changer transitions 0/241 dead transitions. [2024-10-31 22:19:25,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 241 transitions, 827 flow [2024-10-31 22:19:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-31 22:19:25,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-31 22:19:25,241 INFO L175 Difference]: Start difference. First operand has 201 places, 217 transitions, 626 flow. Second operand 4 states and 743 transitions. [2024-10-31 22:19:25,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 241 transitions, 827 flow [2024-10-31 22:19:25,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 241 transitions, 811 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:25,254 INFO L231 Difference]: Finished difference. Result has 205 places, 221 transitions, 693 flow [2024-10-31 22:19:25,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=693, PETRI_PLACES=205, PETRI_TRANSITIONS=221} [2024-10-31 22:19:25,255 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-31 22:19:25,255 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 221 transitions, 693 flow [2024-10-31 22:19:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:25,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:25,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:25,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:25,258 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -715083488, now seen corresponding path program 1 times [2024-10-31 22:19:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999123142] [2024-10-31 22:19:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:25,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999123142] [2024-10-31 22:19:25,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999123142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:25,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:25,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759269100] [2024-10-31 22:19:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:25,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:25,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:19:25,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 221 transitions, 693 flow. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 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-10-31 22:19:25,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:25,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:19:25,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:25,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 31#L1062-11true, 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,610 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-31 22:19:25,611 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:19:25,611 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,611 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][217], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 31#L1062-11true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,613 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-31 22:19:25,613 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:19:25,613 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,613 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 135#L1062-14true, 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,624 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,624 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,624 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is not cut-off event [2024-10-31 22:19:25,624 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is not cut-off event [2024-10-31 22:19:25,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][217], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 135#L1062-14true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,627 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,627 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is not cut-off event [2024-10-31 22:19:25,627 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:19:25,627 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is not cut-off event [2024-10-31 22:19:25,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][217], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 44#L1062-27true, Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,672 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-31 22:19:25,672 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,672 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:19:25,672 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 44#L1062-27true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,700 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-31 22:19:25,700 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-10-31 22:19:25,700 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-31 22:19:25,700 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-31 22:19:25,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 44#L1062-27true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,702 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-31 22:19:25,703 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-10-31 22:19:25,703 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-31 22:19:25,703 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-31 22:19:25,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([549] L1051-->L1051-3: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret9_1| 0) (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21|) |v_~#threads_mask_mutex~0.offset_21| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|, threadThread1of1ForFork0_#t~ret9=|v_threadThread1of1ForFork0_#t~ret9_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret9][209], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 146#L1051-3true, 112#L1062-35true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,706 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-31 22:19:25,706 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:19:25,706 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,706 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,798 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([549] L1051-->L1051-3: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret9_1| 0) (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21|) |v_~#threads_mask_mutex~0.offset_21| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|, threadThread1of1ForFork0_#t~ret9=|v_threadThread1of1ForFork0_#t~ret9_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret9][209], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 195#(= |#race~threads_mask~0| 0), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 146#L1051-3true, 112#L1062-35true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,798 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-31 22:19:25,799 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:19:25,799 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,799 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,799 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:19:25,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][226], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 105#L1063-1true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 185#L1050-18true, 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:25,855 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-31 22:19:25,856 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:19:25,856 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,856 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:19:25,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 193#true, 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 125#L1063-16true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:25,928 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-31 22:19:25,928 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:25,929 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:25,929 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:25,991 INFO L124 PetriNetUnfolderBase]: 593/2644 cut-off events. [2024-10-31 22:19:25,991 INFO L125 PetriNetUnfolderBase]: For 1382/1402 co-relation queries the response was YES. [2024-10-31 22:19:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 2644 events. 593/2644 cut-off events. For 1382/1402 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 20876 event pairs, 76 based on Foata normal form. 15/2352 useless extension candidates. Maximal degree in co-relation 4244. Up to 223 conditions per place. [2024-10-31 22:19:26,016 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 48 selfloop transitions, 7 changer transitions 0/250 dead transitions. [2024-10-31 22:19:26,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 250 transitions, 870 flow [2024-10-31 22:19:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2024-10-31 22:19:26,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9051155115511551 [2024-10-31 22:19:26,019 INFO L175 Difference]: Start difference. First operand has 205 places, 221 transitions, 693 flow. Second operand 6 states and 1097 transitions. [2024-10-31 22:19:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 250 transitions, 870 flow [2024-10-31 22:19:26,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 250 transitions, 856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:26,031 INFO L231 Difference]: Finished difference. Result has 212 places, 226 transitions, 722 flow [2024-10-31 22:19:26,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=722, PETRI_PLACES=212, PETRI_TRANSITIONS=226} [2024-10-31 22:19:26,035 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 25 predicate places. [2024-10-31 22:19:26,035 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 226 transitions, 722 flow [2024-10-31 22:19:26,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 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-10-31 22:19:26,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:26,036 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:19:26,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 12606003, now seen corresponding path program 1 times [2024-10-31 22:19:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377767723] [2024-10-31 22:19:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377767723] [2024-10-31 22:19:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377767723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:26,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427382299] [2024-10-31 22:19:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:26,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:19:26,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 226 transitions, 722 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:26,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:26,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:19:26,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:26,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][190], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:26,488 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,488 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:26,489 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,489 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][190], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:26,493 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:26,493 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,493 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,493 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:26,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 125#L1063-16true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:26,513 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:26,514 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:26,514 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:26,514 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:26,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 93#L1063-20true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:26,566 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-31 22:19:26,566 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:19:26,566 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:19:26,566 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:19:26,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), 156#L1064-3true, Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:26,598 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-31 22:19:26,598 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:19:26,598 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-31 22:19:26,598 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:19:26,704 INFO L124 PetriNetUnfolderBase]: 593/2605 cut-off events. [2024-10-31 22:19:26,704 INFO L125 PetriNetUnfolderBase]: For 2254/2280 co-relation queries the response was YES. [2024-10-31 22:19:26,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4993 conditions, 2605 events. 593/2605 cut-off events. For 2254/2280 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20304 event pairs, 86 based on Foata normal form. 15/2336 useless extension candidates. Maximal degree in co-relation 4609. Up to 388 conditions per place. [2024-10-31 22:19:26,730 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 47 selfloop transitions, 17 changer transitions 0/248 dead transitions. [2024-10-31 22:19:26,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 248 transitions, 918 flow [2024-10-31 22:19:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-31 22:19:26,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-31 22:19:26,733 INFO L175 Difference]: Start difference. First operand has 212 places, 226 transitions, 722 flow. Second operand 4 states and 743 transitions. [2024-10-31 22:19:26,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 248 transitions, 918 flow [2024-10-31 22:19:26,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 248 transitions, 918 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:26,743 INFO L231 Difference]: Finished difference. Result has 217 places, 229 transitions, 802 flow [2024-10-31 22:19:26,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=802, PETRI_PLACES=217, PETRI_TRANSITIONS=229} [2024-10-31 22:19:26,744 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 30 predicate places. [2024-10-31 22:19:26,745 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 229 transitions, 802 flow [2024-10-31 22:19:26,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 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-10-31 22:19:26,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:26,746 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:26,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:19:26,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:26,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2106418618, now seen corresponding path program 1 times [2024-10-31 22:19:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:26,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981539355] [2024-10-31 22:19:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:26,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:26,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981539355] [2024-10-31 22:19:26,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981539355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:26,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:26,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:19:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845064058] [2024-10-31 22:19:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:26,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:19:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:19:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:19:26,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 202 [2024-10-31 22:19:26,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 229 transitions, 802 flow. Second operand has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 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-10-31 22:19:26,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:26,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 202 [2024-10-31 22:19:26,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:27,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][193], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,221 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,221 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,221 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,221 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][193], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), 13#L1062-36true, Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:27,226 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,226 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,226 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,226 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][260], [60#L1063-11true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,376 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,376 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,376 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,376 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][260], [60#L1063-11true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,377 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,377 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,377 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,377 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][261], [60#L1063-11true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,378 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,378 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,378 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:27,378 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:27,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 246#true, 217#true, 125#L1063-16true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,400 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-31 22:19:27,400 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:19:27,400 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:19:27,400 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-31 22:19:27,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), 93#L1063-20true, Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:27,434 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-31 22:19:27,434 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-31 22:19:27,434 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-31 22:19:27,434 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-31 22:19:27,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 246#true, 252#true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 156#L1064-3true, 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:19:27,456 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-10-31 22:19:27,457 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-31 22:19:27,457 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-10-31 22:19:27,457 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-31 22:19:27,536 INFO L124 PetriNetUnfolderBase]: 677/2828 cut-off events. [2024-10-31 22:19:27,536 INFO L125 PetriNetUnfolderBase]: For 4177/4320 co-relation queries the response was YES. [2024-10-31 22:19:27,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6065 conditions, 2828 events. 677/2828 cut-off events. For 4177/4320 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 22628 event pairs, 126 based on Foata normal form. 20/2553 useless extension candidates. Maximal degree in co-relation 5679. Up to 698 conditions per place. [2024-10-31 22:19:27,559 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 51 selfloop transitions, 18 changer transitions 0/262 dead transitions. [2024-10-31 22:19:27,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 262 transitions, 1138 flow [2024-10-31 22:19:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:19:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:19:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2024-10-31 22:19:27,561 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245049504950495 [2024-10-31 22:19:27,561 INFO L175 Difference]: Start difference. First operand has 217 places, 229 transitions, 802 flow. Second operand 4 states and 747 transitions. [2024-10-31 22:19:27,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 262 transitions, 1138 flow [2024-10-31 22:19:27,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 262 transitions, 1114 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:27,576 INFO L231 Difference]: Finished difference. Result has 221 places, 243 transitions, 998 flow [2024-10-31 22:19:27,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=221, PETRI_TRANSITIONS=243} [2024-10-31 22:19:27,577 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 34 predicate places. [2024-10-31 22:19:27,577 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 243 transitions, 998 flow [2024-10-31 22:19:27,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 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-10-31 22:19:27,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:27,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:27,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:19:27,578 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2126736080, now seen corresponding path program 1 times [2024-10-31 22:19:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:27,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342182001] [2024-10-31 22:19:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:27,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342182001] [2024-10-31 22:19:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342182001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548355636] [2024-10-31 22:19:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:27,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:27,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:27,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:19:27,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 243 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-10-31 22:19:27,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:27,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:19:27,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:27,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 217#true, 38#L1050-16true, 260#true, Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:19:27,934 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,934 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,938 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,938 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][184], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 198#true, 260#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0)), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 13#L1062-36true, Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:27,947 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:27,947 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,947 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:27,947 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:28,305 INFO L124 PetriNetUnfolderBase]: 690/3148 cut-off events. [2024-10-31 22:19:28,306 INFO L125 PetriNetUnfolderBase]: For 3600/3652 co-relation queries the response was YES. [2024-10-31 22:19:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6298 conditions, 3148 events. 690/3148 cut-off events. For 3600/3652 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 26956 event pairs, 147 based on Foata normal form. 8/2860 useless extension candidates. Maximal degree in co-relation 5899. Up to 694 conditions per place. [2024-10-31 22:19:28,345 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 35 selfloop transitions, 7 changer transitions 0/252 dead transitions. [2024-10-31 22:19:28,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 252 transitions, 1106 flow [2024-10-31 22:19:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2024-10-31 22:19:28,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9158415841584159 [2024-10-31 22:19:28,348 INFO L175 Difference]: Start difference. First operand has 221 places, 243 transitions, 998 flow. Second operand 3 states and 555 transitions. [2024-10-31 22:19:28,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 252 transitions, 1106 flow [2024-10-31 22:19:28,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 252 transitions, 1106 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:28,364 INFO L231 Difference]: Finished difference. Result has 225 places, 248 transitions, 1054 flow [2024-10-31 22:19:28,365 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=225, PETRI_TRANSITIONS=248} [2024-10-31 22:19:28,366 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 38 predicate places. [2024-10-31 22:19:28,368 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 248 transitions, 1054 flow [2024-10-31 22:19:28,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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-10-31 22:19:28,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:28,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:28,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:19:28,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -733649120, now seen corresponding path program 1 times [2024-10-31 22:19:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:28,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619304378] [2024-10-31 22:19:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619304378] [2024-10-31 22:19:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619304378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:29,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834757225] [2024-10-31 22:19:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:29,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:29,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:29,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:29,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2024-10-31 22:19:29,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 248 transitions, 1054 flow. Second operand has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 0 states have call successors, (0), 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-10-31 22:19:29,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:29,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2024-10-31 22:19:29,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:30,306 INFO L124 PetriNetUnfolderBase]: 954/4079 cut-off events. [2024-10-31 22:19:30,306 INFO L125 PetriNetUnfolderBase]: For 4083/4115 co-relation queries the response was YES. [2024-10-31 22:19:30,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8081 conditions, 4079 events. 954/4079 cut-off events. For 4083/4115 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34961 event pairs, 204 based on Foata normal form. 11/3653 useless extension candidates. Maximal degree in co-relation 7665. Up to 866 conditions per place. [2024-10-31 22:19:30,349 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 54 selfloop transitions, 22 changer transitions 0/285 dead transitions. [2024-10-31 22:19:30,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 285 transitions, 1280 flow [2024-10-31 22:19:30,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1051 transitions. [2024-10-31 22:19:30,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8671617161716172 [2024-10-31 22:19:30,353 INFO L175 Difference]: Start difference. First operand has 225 places, 248 transitions, 1054 flow. Second operand 6 states and 1051 transitions. [2024-10-31 22:19:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 285 transitions, 1280 flow [2024-10-31 22:19:30,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:30,379 INFO L231 Difference]: Finished difference. Result has 233 places, 269 transitions, 1190 flow [2024-10-31 22:19:30,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1190, PETRI_PLACES=233, PETRI_TRANSITIONS=269} [2024-10-31 22:19:30,381 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 46 predicate places. [2024-10-31 22:19:30,381 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 269 transitions, 1190 flow [2024-10-31 22:19:30,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 0 states have call successors, (0), 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-10-31 22:19:30,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:30,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:30,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:19:30,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:30,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1852938791, now seen corresponding path program 1 times [2024-10-31 22:19:30,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775322118] [2024-10-31 22:19:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:30,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775322118] [2024-10-31 22:19:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775322118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903777562] [2024-10-31 22:19:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:31,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 202 [2024-10-31 22:19:31,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 269 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-10-31 22:19:31,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:31,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 202 [2024-10-31 22:19:31,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:31,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][203], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 125#L1063-16true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), 200#(= |#race~datas~0| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:31,851 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2024-10-31 22:19:31,851 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:19:31,851 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:19:31,851 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:19:32,319 INFO L124 PetriNetUnfolderBase]: 1067/4412 cut-off events. [2024-10-31 22:19:32,319 INFO L125 PetriNetUnfolderBase]: For 4669/4742 co-relation queries the response was YES. [2024-10-31 22:19:32,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 4412 events. 1067/4412 cut-off events. For 4669/4742 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 38705 event pairs, 184 based on Foata normal form. 26/4048 useless extension candidates. Maximal degree in co-relation 8994. Up to 1070 conditions per place. [2024-10-31 22:19:32,366 INFO L140 encePairwiseOnDemand]: 187/202 looper letters, 82 selfloop transitions, 48 changer transitions 0/344 dead transitions. [2024-10-31 22:19:32,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 344 transitions, 1734 flow [2024-10-31 22:19:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2024-10-31 22:19:32,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9026402640264026 [2024-10-31 22:19:32,370 INFO L175 Difference]: Start difference. First operand has 233 places, 269 transitions, 1190 flow. Second operand 6 states and 1094 transitions. [2024-10-31 22:19:32,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 344 transitions, 1734 flow [2024-10-31 22:19:32,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 344 transitions, 1734 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:32,403 INFO L231 Difference]: Finished difference. Result has 243 places, 312 transitions, 1578 flow [2024-10-31 22:19:32,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1578, PETRI_PLACES=243, PETRI_TRANSITIONS=312} [2024-10-31 22:19:32,405 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 56 predicate places. [2024-10-31 22:19:32,405 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 312 transitions, 1578 flow [2024-10-31 22:19:32,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 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-10-31 22:19:32,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:32,406 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:19:32,407 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -449837390, now seen corresponding path program 1 times [2024-10-31 22:19:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668142590] [2024-10-31 22:19:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:19:33,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:33,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668142590] [2024-10-31 22:19:33,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668142590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379417394] [2024-10-31 22:19:33,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:19:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:19:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:19:33,288 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2024-10-31 22:19:33,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 312 transitions, 1578 flow. Second operand has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 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-10-31 22:19:33,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:33,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2024-10-31 22:19:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:34,330 INFO L124 PetriNetUnfolderBase]: 1031/4348 cut-off events. [2024-10-31 22:19:34,330 INFO L125 PetriNetUnfolderBase]: For 5294/5355 co-relation queries the response was YES. [2024-10-31 22:19:34,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10161 conditions, 4348 events. 1031/4348 cut-off events. For 5294/5355 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 38053 event pairs, 202 based on Foata normal form. 17/3999 useless extension candidates. Maximal degree in co-relation 9704. Up to 1130 conditions per place. [2024-10-31 22:19:34,370 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 102 selfloop transitions, 31 changer transitions 11/356 dead transitions. [2024-10-31 22:19:34,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 356 transitions, 2059 flow [2024-10-31 22:19:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2024-10-31 22:19:34,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8762376237623762 [2024-10-31 22:19:34,374 INFO L175 Difference]: Start difference. First operand has 243 places, 312 transitions, 1578 flow. Second operand 6 states and 1062 transitions. [2024-10-31 22:19:34,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 356 transitions, 2059 flow [2024-10-31 22:19:34,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 356 transitions, 2041 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:34,414 INFO L231 Difference]: Finished difference. Result has 253 places, 333 transitions, 1861 flow [2024-10-31 22:19:34,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1861, PETRI_PLACES=253, PETRI_TRANSITIONS=333} [2024-10-31 22:19:34,415 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 66 predicate places. [2024-10-31 22:19:34,415 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 333 transitions, 1861 flow [2024-10-31 22:19:34,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 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-10-31 22:19:34,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:34,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:19:34,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:34,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1759250776, now seen corresponding path program 1 times [2024-10-31 22:19:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592150274] [2024-10-31 22:19:34,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:19:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592150274] [2024-10-31 22:19:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592150274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:19:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497487521] [2024-10-31 22:19:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:19:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:19:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:35,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 202 [2024-10-31 22:19:35,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 333 transitions, 1861 flow. Second operand has 11 states, 11 states have (on average 159.45454545454547) internal successors, (1754), 11 states have internal predecessors, (1754), 0 states have call successors, (0), 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-10-31 22:19:35,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:35,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 202 [2024-10-31 22:19:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:36,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][224], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), Black: 198#true, 276#true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 219#(not (= ~threads_mask~0 0)), Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 188#true, 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 217#true, 125#L1063-16true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), 200#(= |#race~datas~0| 0), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:36,839 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2024-10-31 22:19:36,839 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:19:36,839 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:19:36,839 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:19:37,227 INFO L124 PetriNetUnfolderBase]: 1144/4717 cut-off events. [2024-10-31 22:19:37,227 INFO L125 PetriNetUnfolderBase]: For 6107/6191 co-relation queries the response was YES. [2024-10-31 22:19:37,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11400 conditions, 4717 events. 1144/4717 cut-off events. For 6107/6191 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 41993 event pairs, 179 based on Foata normal form. 55/4396 useless extension candidates. Maximal degree in co-relation 10912. Up to 858 conditions per place. [2024-10-31 22:19:37,264 INFO L140 encePairwiseOnDemand]: 187/202 looper letters, 173 selfloop transitions, 70 changer transitions 2/447 dead transitions. [2024-10-31 22:19:37,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 447 transitions, 2951 flow [2024-10-31 22:19:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-31 22:19:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-31 22:19:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2963 transitions. [2024-10-31 22:19:37,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.814906490649065 [2024-10-31 22:19:37,272 INFO L175 Difference]: Start difference. First operand has 253 places, 333 transitions, 1861 flow. Second operand 18 states and 2963 transitions. [2024-10-31 22:19:37,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 447 transitions, 2951 flow [2024-10-31 22:19:37,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 447 transitions, 2895 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:37,317 INFO L231 Difference]: Finished difference. Result has 266 places, 351 transitions, 2070 flow [2024-10-31 22:19:37,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2070, PETRI_PLACES=266, PETRI_TRANSITIONS=351} [2024-10-31 22:19:37,318 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 79 predicate places. [2024-10-31 22:19:37,318 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 351 transitions, 2070 flow [2024-10-31 22:19:37,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 159.45454545454547) internal successors, (1754), 11 states have internal predecessors, (1754), 0 states have call successors, (0), 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-10-31 22:19:37,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:37,319 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:37,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:19:37,320 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1166856144, now seen corresponding path program 1 times [2024-10-31 22:19:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563216649] [2024-10-31 22:19:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:19:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563216649] [2024-10-31 22:19:38,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563216649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:38,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:19:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647029716] [2024-10-31 22:19:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:19:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:19:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:19:38,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 202 [2024-10-31 22:19:38,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 351 transitions, 2070 flow. Second operand has 11 states, 11 states have (on average 159.36363636363637) internal successors, (1753), 11 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:38,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:38,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 202 [2024-10-31 22:19:38,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:40,102 INFO L124 PetriNetUnfolderBase]: 1039/4348 cut-off events. [2024-10-31 22:19:40,102 INFO L125 PetriNetUnfolderBase]: For 6172/6233 co-relation queries the response was YES. [2024-10-31 22:19:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10861 conditions, 4348 events. 1039/4348 cut-off events. For 6172/6233 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 37930 event pairs, 187 based on Foata normal form. 28/4023 useless extension candidates. Maximal degree in co-relation 10374. Up to 970 conditions per place. [2024-10-31 22:19:40,133 INFO L140 encePairwiseOnDemand]: 189/202 looper letters, 143 selfloop transitions, 42 changer transitions 6/397 dead transitions. [2024-10-31 22:19:40,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 397 transitions, 2750 flow [2024-10-31 22:19:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:19:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-31 22:19:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2128 transitions. [2024-10-31 22:19:40,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8103579588728104 [2024-10-31 22:19:40,139 INFO L175 Difference]: Start difference. First operand has 266 places, 351 transitions, 2070 flow. Second operand 13 states and 2128 transitions. [2024-10-31 22:19:40,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 397 transitions, 2750 flow [2024-10-31 22:19:40,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 397 transitions, 2589 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-10-31 22:19:40,185 INFO L231 Difference]: Finished difference. Result has 269 places, 350 transitions, 2027 flow [2024-10-31 22:19:40,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2027, PETRI_PLACES=269, PETRI_TRANSITIONS=350} [2024-10-31 22:19:40,186 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 82 predicate places. [2024-10-31 22:19:40,186 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 350 transitions, 2027 flow [2024-10-31 22:19:40,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 159.36363636363637) internal successors, (1753), 11 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:40,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:40,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:40,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:19:40,188 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:40,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 558586246, now seen corresponding path program 1 times [2024-10-31 22:19:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:40,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949452895] [2024-10-31 22:19:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:40,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949452895] [2024-10-31 22:19:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949452895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:40,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:40,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360612518] [2024-10-31 22:19:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:40,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:40,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:40,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202 [2024-10-31 22:19:40,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 350 transitions, 2027 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-10-31 22:19:40,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:40,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202 [2024-10-31 22:19:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:40,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 252#true, 217#true, 38#L1050-16true, Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 13#L1062-36true, Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:40,702 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:40,702 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,702 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,702 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][218], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 232#(not (= ~threads_mask~0 0)), 252#true, 217#true, 38#L1050-16true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), 13#L1062-36true, Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:40,710 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:19:40,710 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,710 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,710 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:19:40,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][289], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 105#L1063-1true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 185#L1050-18true, 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 252#true, 217#true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:40,977 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-31 22:19:40,977 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:19:40,977 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:19:40,977 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:19:40,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][289], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 105#L1063-1true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 252#true, 217#true, 136#L1050-19true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:40,994 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-31 22:19:40,994 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:19:40,994 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-31 22:19:40,995 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:19:41,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][297], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 105#L1063-1true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 252#true, 217#true, 146#L1051-3true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:41,049 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-31 22:19:41,049 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:19:41,049 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:19:41,049 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:41,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][297], [Black: 257#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 254#(<= 0 (+ ~threads_mask~0 1)), Black: 193#true, Black: 298#true, Black: 262#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|), 276#true, Black: 198#true, 105#L1063-1true, 265#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 353#true, Black: 267#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 270#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 278#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 126#L1051true, Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 287#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 289#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 226#(not (= ~threads_mask~0 0)), 316#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 252#true, 217#true, Black: 240#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 238#(< 0 |ULTIMATE.start_main_#t~ret15#1|), 200#(= |#race~datas~0| 0), Black: 239#(< 1 |ULTIMATE.start_main_#t~ret15#1|), Black: 248#(not (= ~threads_mask~0 0)), Black: 249#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1))]) [2024-10-31 22:19:41,050 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-31 22:19:41,050 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:19:41,050 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:19:41,050 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:19:41,210 INFO L124 PetriNetUnfolderBase]: 1199/4865 cut-off events. [2024-10-31 22:19:41,211 INFO L125 PetriNetUnfolderBase]: For 5840/6041 co-relation queries the response was YES. [2024-10-31 22:19:41,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11371 conditions, 4865 events. 1199/4865 cut-off events. For 5840/6041 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 44537 event pairs, 203 based on Foata normal form. 28/4507 useless extension candidates. Maximal degree in co-relation 10897. Up to 1049 conditions per place. [2024-10-31 22:19:41,271 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 39 selfloop transitions, 11 changer transitions 3/367 dead transitions. [2024-10-31 22:19:41,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 367 transitions, 2197 flow [2024-10-31 22:19:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2024-10-31 22:19:41,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273927392739274 [2024-10-31 22:19:41,274 INFO L175 Difference]: Start difference. First operand has 269 places, 350 transitions, 2027 flow. Second operand 3 states and 562 transitions. [2024-10-31 22:19:41,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 367 transitions, 2197 flow [2024-10-31 22:19:41,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 367 transitions, 2120 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-10-31 22:19:41,327 INFO L231 Difference]: Finished difference. Result has 262 places, 354 transitions, 2007 flow [2024-10-31 22:19:41,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2007, PETRI_PLACES=262, PETRI_TRANSITIONS=354} [2024-10-31 22:19:41,328 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 75 predicate places. [2024-10-31 22:19:41,328 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 354 transitions, 2007 flow [2024-10-31 22:19:41,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-10-31 22:19:41,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:41,329 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:19:41,330 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -38810541, now seen corresponding path program 1 times [2024-10-31 22:19:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561207763] [2024-10-31 22:19:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561207763] [2024-10-31 22:19:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561207763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:19:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877346626] [2024-10-31 22:19:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:41,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 202 [2024-10-31 22:19:41,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 354 transitions, 2007 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:41,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:41,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 202 [2024-10-31 22:19:41,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:41,801 INFO L124 PetriNetUnfolderBase]: 314/1673 cut-off events. [2024-10-31 22:19:41,801 INFO L125 PetriNetUnfolderBase]: For 2012/2091 co-relation queries the response was YES. [2024-10-31 22:19:41,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 1673 events. 314/1673 cut-off events. For 2012/2091 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10095 event pairs, 2 based on Foata normal form. 12/1625 useless extension candidates. Maximal degree in co-relation 3759. Up to 182 conditions per place. [2024-10-31 22:19:41,817 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 11 selfloop transitions, 4 changer transitions 0/307 dead transitions. [2024-10-31 22:19:41,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1651 flow [2024-10-31 22:19:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-10-31 22:19:41,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-10-31 22:19:41,819 INFO L175 Difference]: Start difference. First operand has 262 places, 354 transitions, 2007 flow. Second operand 3 states and 567 transitions. [2024-10-31 22:19:41,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1651 flow [2024-10-31 22:19:41,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 307 transitions, 1588 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-10-31 22:19:41,848 INFO L231 Difference]: Finished difference. Result has 249 places, 307 transitions, 1566 flow [2024-10-31 22:19:41,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1566, PETRI_PLACES=249, PETRI_TRANSITIONS=307} [2024-10-31 22:19:41,849 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 62 predicate places. [2024-10-31 22:19:41,850 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 307 transitions, 1566 flow [2024-10-31 22:19:41,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:19:41,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:41,851 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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-10-31 22:19:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:19:41,851 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:41,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1132359509, now seen corresponding path program 1 times [2024-10-31 22:19:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:41,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327165368] [2024-10-31 22:19:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:19:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327165368] [2024-10-31 22:19:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327165368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467770967] [2024-10-31 22:19:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:42,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:42,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-31 22:19:42,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 307 transitions, 1566 flow. Second operand has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 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-10-31 22:19:42,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:42,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-31 22:19:42,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:42,833 INFO L124 PetriNetUnfolderBase]: 615/2824 cut-off events. [2024-10-31 22:19:42,833 INFO L125 PetriNetUnfolderBase]: For 3256/3419 co-relation queries the response was YES. [2024-10-31 22:19:42,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7092 conditions, 2824 events. 615/2824 cut-off events. For 3256/3419 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 20571 event pairs, 2 based on Foata normal form. 1/2699 useless extension candidates. Maximal degree in co-relation 6134. Up to 358 conditions per place. [2024-10-31 22:19:42,852 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 48 selfloop transitions, 12 changer transitions 14/336 dead transitions. [2024-10-31 22:19:42,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 336 transitions, 1861 flow [2024-10-31 22:19:42,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2024-10-31 22:19:42,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2024-10-31 22:19:42,855 INFO L175 Difference]: Start difference. First operand has 249 places, 307 transitions, 1566 flow. Second operand 6 states and 1086 transitions. [2024-10-31 22:19:42,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 336 transitions, 1861 flow [2024-10-31 22:19:42,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 336 transitions, 1854 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:42,891 INFO L231 Difference]: Finished difference. Result has 257 places, 307 transitions, 1628 flow [2024-10-31 22:19:42,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1628, PETRI_PLACES=257, PETRI_TRANSITIONS=307} [2024-10-31 22:19:42,892 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 70 predicate places. [2024-10-31 22:19:42,892 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 307 transitions, 1628 flow [2024-10-31 22:19:42,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 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-10-31 22:19:42,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:42,893 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-10-31 22:19:42,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:19:42,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 567849923, now seen corresponding path program 1 times [2024-10-31 22:19:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44290189] [2024-10-31 22:19:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:42,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:19:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44290189] [2024-10-31 22:19:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44290189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:43,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:19:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105255164] [2024-10-31 22:19:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:43,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:19:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:19:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:19:43,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-31 22:19:43,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 307 transitions, 1628 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 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-10-31 22:19:43,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:43,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-31 22:19:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:44,256 INFO L124 PetriNetUnfolderBase]: 1066/4472 cut-off events. [2024-10-31 22:19:44,256 INFO L125 PetriNetUnfolderBase]: For 6170/6481 co-relation queries the response was YES. [2024-10-31 22:19:44,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11904 conditions, 4472 events. 1066/4472 cut-off events. For 6170/6481 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 37806 event pairs, 5 based on Foata normal form. 1/4264 useless extension candidates. Maximal degree in co-relation 10478. Up to 629 conditions per place. [2024-10-31 22:19:44,321 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 62 selfloop transitions, 16 changer transitions 0/340 dead transitions. [2024-10-31 22:19:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 340 transitions, 2008 flow [2024-10-31 22:19:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:19:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:19:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2024-10-31 22:19:44,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2024-10-31 22:19:44,324 INFO L175 Difference]: Start difference. First operand has 257 places, 307 transitions, 1628 flow. Second operand 6 states and 1086 transitions. [2024-10-31 22:19:44,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 340 transitions, 2008 flow [2024-10-31 22:19:44,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 340 transitions, 2000 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:44,385 INFO L231 Difference]: Finished difference. Result has 263 places, 321 transitions, 1806 flow [2024-10-31 22:19:44,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1806, PETRI_PLACES=263, PETRI_TRANSITIONS=321} [2024-10-31 22:19:44,386 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 76 predicate places. [2024-10-31 22:19:44,386 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 321 transitions, 1806 flow [2024-10-31 22:19:44,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 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-10-31 22:19:44,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:44,387 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:19:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:19:44,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:19:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 955441698, now seen corresponding path program 1 times [2024-10-31 22:19:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:44,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479414776] [2024-10-31 22:19:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:19:44,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:19:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat