./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 78bf651a68246edb64b33b075c5e2594038ee9ad56ae541633915ca819c0a582 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:27,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:27,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:11:27,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:27,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:27,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:27,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:27,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:27,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:27,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:27,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:27,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:27,371 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:27,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:27,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:27,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:27,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:27,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:27,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:27,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:27,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:27,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 78bf651a68246edb64b33b075c5e2594038ee9ad56ae541633915ca819c0a582 [2025-04-29 11:11:27,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:27,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:27,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:27,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:27,605 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:27,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-3.c [2025-04-29 11:11:28,871 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc9a29cd/4c1e223f03e1437ba895c54b273ab709/FLAG5e4ac6fff [2025-04-29 11:11:29,066 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:29,067 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-3.c [2025-04-29 11:11:29,074 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:29,099 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc9a29cd/4c1e223f03e1437ba895c54b273ab709/FLAG5e4ac6fff [2025-04-29 11:11:29,922 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dc9a29cd/4c1e223f03e1437ba895c54b273ab709 [2025-04-29 11:11:29,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:29,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:29,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:29,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:29,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:29,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:29" (1/1) ... [2025-04-29 11:11:29,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6281d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:29, skipping insertion in model container [2025-04-29 11:11:29,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:29" (1/1) ... [2025-04-29 11:11:29,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:30,087 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:30,094 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:30,129 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:30,141 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:30,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30 WrapperNode [2025-04-29 11:11:30,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:30,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:30,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:30,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:30,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,176 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-04-29 11:11:30,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:30,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:30,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:30,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:30,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:30,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:30,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:30,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:30,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (1/1) ... [2025-04-29 11:11:30,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:30,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:11:30,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:11:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:30,251 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:11:30,316 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:30,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:30,445 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:30,445 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:30,462 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:30,463 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:30,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:30 BoogieIcfgContainer [2025-04-29 11:11:30,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:30,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:30,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:30,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:30,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:29" (1/3) ... [2025-04-29 11:11:30,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beca6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:30, skipping insertion in model container [2025-04-29 11:11:30,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:30" (2/3) ... [2025-04-29 11:11:30,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beca6ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:30, skipping insertion in model container [2025-04-29 11:11:30,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:30" (3/3) ... [2025-04-29 11:11:30,470 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.c [2025-04-29 11:11:30,482 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:30,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-3.c that has 2 procedures, 86 locations, 86 edges, 1 initial locations, 2 loop locations, and 5 error locations. [2025-04-29 11:11:30,484 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:30,547 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 224 flow [2025-04-29 11:11:30,641 INFO L116 PetriNetUnfolderBase]: 2/215 cut-off events. [2025-04-29 11:11:30,642 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:30,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 215 events. 2/215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 595 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 61. Up to 5 conditions per place. [2025-04-29 11:11:30,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 224 flow [2025-04-29 11:11:30,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 104 transitions, 221 flow [2025-04-29 11:11:30,654 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:30,664 INFO L340 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;@37878b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:30,665 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:11:30,672 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:30,673 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-29 11:11:30,674 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:30,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:30,675 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:30,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -510262935, now seen corresponding path program 1 times [2025-04-29 11:11:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:30,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438067264] [2025-04-29 11:11:30,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:30,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:30,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:30,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:30,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:31,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438067264] [2025-04-29 11:11:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438067264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134519859] [2025-04-29 11:11:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:31,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:31,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:31,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:31,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-04-29 11:11:31,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:31,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-04-29 11:11:31,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,541 INFO L116 PetriNetUnfolderBase]: 138/801 cut-off events. [2025-04-29 11:11:31,541 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-29 11:11:31,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 801 events. 138/801 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5065 event pairs, 87 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 846. Up to 276 conditions per place. [2025-04-29 11:11:31,548 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 33 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-04-29 11:11:31,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 311 flow [2025-04-29 11:11:31,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 483 transitions. [2025-04-29 11:11:31,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2025-04-29 11:11:31,562 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 221 flow. Second operand 6 states and 483 transitions. [2025-04-29 11:11:31,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 311 flow [2025-04-29 11:11:31,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 111 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:31,571 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 225 flow [2025-04-29 11:11:31,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2025-04-29 11:11:31,575 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 2 predicate places. [2025-04-29 11:11:31,575 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 103 transitions, 225 flow [2025-04-29 11:11:31,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:31,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:31,576 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:31,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1340224865, now seen corresponding path program 1 times [2025-04-29 11:11:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054966651] [2025-04-29 11:11:31,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:11:31,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:11:31,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:31,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054966651] [2025-04-29 11:11:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054966651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:31,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490958735] [2025-04-29 11:11:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:31,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:31,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:31,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 105 [2025-04-29 11:11:31,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 103 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:31,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 105 [2025-04-29 11:11:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,705 INFO L116 PetriNetUnfolderBase]: 33/412 cut-off events. [2025-04-29 11:11:31,706 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-29 11:11:31,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 412 events. 33/412 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1797 event pairs, 9 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 459. Up to 43 conditions per place. [2025-04-29 11:11:31,708 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 17 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-04-29 11:11:31,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 279 flow [2025-04-29 11:11:31,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 382 transitions. [2025-04-29 11:11:31,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9095238095238095 [2025-04-29 11:11:31,710 INFO L175 Difference]: Start difference. First operand has 110 places, 103 transitions, 225 flow. Second operand 4 states and 382 transitions. [2025-04-29 11:11:31,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 279 flow [2025-04-29 11:11:31,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 269 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:31,712 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 227 flow [2025-04-29 11:11:31,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2025-04-29 11:11:31,713 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 1 predicate places. [2025-04-29 11:11:31,713 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 227 flow [2025-04-29 11:11:31,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:31,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:31,714 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:31,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1112299821, now seen corresponding path program 1 times [2025-04-29 11:11:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038004360] [2025-04-29 11:11:31,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:31,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:31,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:31,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038004360] [2025-04-29 11:11:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038004360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091186316] [2025-04-29 11:11:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:31,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:31,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:31,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:31,753 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 105 [2025-04-29 11:11:31,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:31,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 105 [2025-04-29 11:11:31,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,833 INFO L116 PetriNetUnfolderBase]: 112/672 cut-off events. [2025-04-29 11:11:31,834 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-29 11:11:31,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 672 events. 112/672 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4100 event pairs, 75 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 879. Up to 182 conditions per place. [2025-04-29 11:11:31,840 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 18 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-04-29 11:11:31,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 291 flow [2025-04-29 11:11:31,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-04-29 11:11:31,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:11:31,843 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 227 flow. Second operand 3 states and 294 transitions. [2025-04-29 11:11:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 291 flow [2025-04-29 11:11:31,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 283 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:31,846 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 257 flow [2025-04-29 11:11:31,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-04-29 11:11:31,848 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 2 predicate places. [2025-04-29 11:11:31,848 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 257 flow [2025-04-29 11:11:31,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,848 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:31,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:31,849 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:31,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash -613658827, now seen corresponding path program 1 times [2025-04-29 11:11:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809644311] [2025-04-29 11:11:31,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:31,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:31,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:31,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:31,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:31,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:31,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:31,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:31,901 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:31,902 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:11:31,903 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:11:31,904 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:11:31,904 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:11:31,904 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:11:31,904 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-04-29 11:11:31,905 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:11:31,905 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:11:31,905 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:11:31,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:31,905 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-29 11:11:31,907 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:31,908 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:31,934 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:11:31,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 141 transitions, 314 flow [2025-04-29 11:11:31,972 INFO L116 PetriNetUnfolderBase]: 7/382 cut-off events. [2025-04-29 11:11:31,973 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-29 11:11:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 382 events. 7/382 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1324 event pairs, 1 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 405. Up to 12 conditions per place. [2025-04-29 11:11:31,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 141 transitions, 314 flow [2025-04-29 11:11:31,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 266 flow [2025-04-29 11:11:31,977 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:31,978 INFO L340 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;@37878b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:31,978 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:11:31,980 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:31,981 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-29 11:11:31,981 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:31,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:31,981 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:31,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1775950107, now seen corresponding path program 1 times [2025-04-29 11:11:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709006497] [2025-04-29 11:11:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:31,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:32,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709006497] [2025-04-29 11:11:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709006497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121837394] [2025-04-29 11:11:32,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:32,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:32,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2025-04-29 11:11:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2025-04-29 11:11:32,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:32,617 INFO L116 PetriNetUnfolderBase]: 879/3352 cut-off events. [2025-04-29 11:11:32,617 INFO L117 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-04-29 11:11:32,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 3352 events. 879/3352 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 29520 event pairs, 243 based on Foata normal form. 0/3028 useless extension candidates. Maximal degree in co-relation 1443. Up to 1365 conditions per place. [2025-04-29 11:11:32,637 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 45 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-04-29 11:11:32,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 396 flow [2025-04-29 11:11:32,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2025-04-29 11:11:32,640 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7836879432624113 [2025-04-29 11:11:32,640 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 266 flow. Second operand 6 states and 663 transitions. [2025-04-29 11:11:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 396 flow [2025-04-29 11:11:32,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 137 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:32,643 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 270 flow [2025-04-29 11:11:32,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2025-04-29 11:11:32,644 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 2 predicate places. [2025-04-29 11:11:32,644 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 270 flow [2025-04-29 11:11:32,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:32,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:32,645 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:32,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash 758628321, now seen corresponding path program 1 times [2025-04-29 11:11:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122554042] [2025-04-29 11:11:32,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:11:32,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:11:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122554042] [2025-04-29 11:11:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122554042] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678123002] [2025-04-29 11:11:32,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:32,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:32,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:32,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 141 [2025-04-29 11:11:32,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 141 [2025-04-29 11:11:32,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:32,890 INFO L116 PetriNetUnfolderBase]: 253/1659 cut-off events. [2025-04-29 11:11:32,891 INFO L117 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-04-29 11:11:32,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2191 conditions, 1659 events. 253/1659 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12319 event pairs, 68 based on Foata normal form. 1/1490 useless extension candidates. Maximal degree in co-relation 679. Up to 267 conditions per place. [2025-04-29 11:11:32,897 INFO L140 encePairwiseOnDemand]: 136/141 looper letters, 24 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-04-29 11:11:32,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 130 transitions, 344 flow [2025-04-29 11:11:32,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2025-04-29 11:11:32,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8882978723404256 [2025-04-29 11:11:32,900 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 270 flow. Second operand 4 states and 501 transitions. [2025-04-29 11:11:32,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 130 transitions, 344 flow [2025-04-29 11:11:32,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 334 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:32,904 INFO L231 Difference]: Finished difference. Result has 128 places, 122 transitions, 276 flow [2025-04-29 11:11:32,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=128, PETRI_TRANSITIONS=122} [2025-04-29 11:11:32,904 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2025-04-29 11:11:32,904 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 276 flow [2025-04-29 11:11:32,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:32,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:32,905 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:32,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1563460327, now seen corresponding path program 1 times [2025-04-29 11:11:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980072045] [2025-04-29 11:11:32,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:32,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:32,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:32,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:32,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980072045] [2025-04-29 11:11:32,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980072045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221186823] [2025-04-29 11:11:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:32,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:32,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:32,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 141 [2025-04-29 11:11:32,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:32,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 141 [2025-04-29 11:11:32,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:33,256 INFO L116 PetriNetUnfolderBase]: 1070/3958 cut-off events. [2025-04-29 11:11:33,257 INFO L117 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-04-29 11:11:33,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5827 conditions, 3958 events. 1070/3958 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37130 event pairs, 701 based on Foata normal form. 0/3514 useless extension candidates. Maximal degree in co-relation 5709. Up to 1393 conditions per place. [2025-04-29 11:11:33,275 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 27 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-04-29 11:11:33,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 135 transitions, 378 flow [2025-04-29 11:11:33,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-04-29 11:11:33,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9030732860520094 [2025-04-29 11:11:33,279 INFO L175 Difference]: Start difference. First operand has 128 places, 122 transitions, 276 flow. Second operand 3 states and 382 transitions. [2025-04-29 11:11:33,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 135 transitions, 378 flow [2025-04-29 11:11:33,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 135 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:33,281 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 316 flow [2025-04-29 11:11:33,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-04-29 11:11:33,284 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 3 predicate places. [2025-04-29 11:11:33,284 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 316 flow [2025-04-29 11:11:33,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:33,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:33,285 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:33,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1016797762, now seen corresponding path program 1 times [2025-04-29 11:11:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139000933] [2025-04-29 11:11:33,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:33,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:33,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:33,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139000933] [2025-04-29 11:11:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139000933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313907241] [2025-04-29 11:11:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:33,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:33,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:33,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 141 [2025-04-29 11:11:33,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 141 [2025-04-29 11:11:33,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:33,693 INFO L116 PetriNetUnfolderBase]: 624/3462 cut-off events. [2025-04-29 11:11:33,693 INFO L117 PetriNetUnfolderBase]: For 302/314 co-relation queries the response was YES. [2025-04-29 11:11:33,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 3462 events. 624/3462 cut-off events. For 302/314 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 31689 event pairs, 151 based on Foata normal form. 3/3041 useless extension candidates. Maximal degree in co-relation 3423. Up to 391 conditions per place. [2025-04-29 11:11:33,708 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 33 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2025-04-29 11:11:33,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 145 transitions, 432 flow [2025-04-29 11:11:33,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2025-04-29 11:11:33,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8642350557244174 [2025-04-29 11:11:33,711 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 316 flow. Second operand 7 states and 853 transitions. [2025-04-29 11:11:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 145 transitions, 432 flow [2025-04-29 11:11:33,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 145 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:33,714 INFO L231 Difference]: Finished difference. Result has 137 places, 129 transitions, 334 flow [2025-04-29 11:11:33,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=137, PETRI_TRANSITIONS=129} [2025-04-29 11:11:33,715 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2025-04-29 11:11:33,715 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 334 flow [2025-04-29 11:11:33,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:33,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:33,715 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:33,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2117337371, now seen corresponding path program 1 times [2025-04-29 11:11:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221502183] [2025-04-29 11:11:33,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:33,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:33,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221502183] [2025-04-29 11:11:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221502183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192237349] [2025-04-29 11:11:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:33,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:33,775 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 141 [2025-04-29 11:11:33,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 141 [2025-04-29 11:11:33,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,248 INFO L116 PetriNetUnfolderBase]: 1661/6013 cut-off events. [2025-04-29 11:11:34,248 INFO L117 PetriNetUnfolderBase]: For 1158/1202 co-relation queries the response was YES. [2025-04-29 11:11:34,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9994 conditions, 6013 events. 1661/6013 cut-off events. For 1158/1202 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 60073 event pairs, 951 based on Foata normal form. 2/5313 useless extension candidates. Maximal degree in co-relation 9889. Up to 2039 conditions per place. [2025-04-29 11:11:34,286 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 28 selfloop transitions, 9 changer transitions 0/143 dead transitions. [2025-04-29 11:11:34,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 451 flow [2025-04-29 11:11:34,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2025-04-29 11:11:34,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2025-04-29 11:11:34,287 INFO L175 Difference]: Start difference. First operand has 137 places, 129 transitions, 334 flow. Second operand 3 states and 381 transitions. [2025-04-29 11:11:34,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 451 flow [2025-04-29 11:11:34,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 143 transitions, 441 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:34,295 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 400 flow [2025-04-29 11:11:34,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-04-29 11:11:34,296 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 11 predicate places. [2025-04-29 11:11:34,297 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 400 flow [2025-04-29 11:11:34,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,298 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:34,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:34,298 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:11:34,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash 978349843, now seen corresponding path program 1 times [2025-04-29 11:11:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361016567] [2025-04-29 11:11:34,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:34,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:34,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:34,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:34,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:34,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:34,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:34,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:34,332 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:11:34,332 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:11:34,333 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:11:34,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:34,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:11:34,333 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:34,333 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:11:34,354 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-29 11:11:34,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 408 flow [2025-04-29 11:11:34,401 INFO L116 PetriNetUnfolderBase]: 20/653 cut-off events. [2025-04-29 11:11:34,402 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-29 11:11:34,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 653 events. 20/653 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2762 event pairs, 6 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 702. Up to 32 conditions per place. [2025-04-29 11:11:34,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 177 transitions, 408 flow [2025-04-29 11:11:34,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 140 transitions, 313 flow [2025-04-29 11:11:34,405 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:34,405 INFO L340 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;@37878b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:34,405 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:11:34,407 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:34,407 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-29 11:11:34,407 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:34,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:34,407 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:34,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1192337531, now seen corresponding path program 1 times [2025-04-29 11:11:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189853092] [2025-04-29 11:11:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:34,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:34,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189853092] [2025-04-29 11:11:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189853092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919000257] [2025-04-29 11:11:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:34,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:34,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:34,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 177 [2025-04-29 11:11:34,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 140 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 177 [2025-04-29 11:11:34,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,730 INFO L116 PetriNetUnfolderBase]: 4644/13791 cut-off events. [2025-04-29 11:11:35,730 INFO L117 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2025-04-29 11:11:35,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21202 conditions, 13791 events. 4644/13791 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 145436 event pairs, 1056 based on Foata normal form. 0/12568 useless extension candidates. Maximal degree in co-relation 4978. Up to 6402 conditions per place. [2025-04-29 11:11:35,813 INFO L140 encePairwiseOnDemand]: 171/177 looper letters, 57 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-04-29 11:11:35,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 163 transitions, 483 flow [2025-04-29 11:11:35,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2025-04-29 11:11:35,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7937853107344632 [2025-04-29 11:11:35,816 INFO L175 Difference]: Start difference. First operand has 146 places, 140 transitions, 313 flow. Second operand 6 states and 843 transitions. [2025-04-29 11:11:35,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 163 transitions, 483 flow [2025-04-29 11:11:35,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 163 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:35,819 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 317 flow [2025-04-29 11:11:35,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2025-04-29 11:11:35,820 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 2 predicate places. [2025-04-29 11:11:35,820 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 317 flow [2025-04-29 11:11:35,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:35,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:35,821 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:35,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1670749153, now seen corresponding path program 1 times [2025-04-29 11:11:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068534997] [2025-04-29 11:11:35,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:11:35,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:11:35,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068534997] [2025-04-29 11:11:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068534997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817913157] [2025-04-29 11:11:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:35,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:35,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 177 [2025-04-29 11:11:35,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 177 [2025-04-29 11:11:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:36,414 INFO L116 PetriNetUnfolderBase]: 1407/6246 cut-off events. [2025-04-29 11:11:36,414 INFO L117 PetriNetUnfolderBase]: For 782/782 co-relation queries the response was YES. [2025-04-29 11:11:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 6246 events. 1407/6246 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 61017 event pairs, 655 based on Foata normal form. 1/5668 useless extension candidates. Maximal degree in co-relation 4631. Up to 1305 conditions per place. [2025-04-29 11:11:36,436 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 30 selfloop transitions, 4 changer transitions 0/150 dead transitions. [2025-04-29 11:11:36,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 150 transitions, 407 flow [2025-04-29 11:11:36,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2025-04-29 11:11:36,438 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8742937853107344 [2025-04-29 11:11:36,438 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 317 flow. Second operand 4 states and 619 transitions. [2025-04-29 11:11:36,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 150 transitions, 407 flow [2025-04-29 11:11:36,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 150 transitions, 397 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:36,441 INFO L231 Difference]: Finished difference. Result has 147 places, 140 transitions, 323 flow [2025-04-29 11:11:36,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=147, PETRI_TRANSITIONS=140} [2025-04-29 11:11:36,441 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 1 predicate places. [2025-04-29 11:11:36,441 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 140 transitions, 323 flow [2025-04-29 11:11:36,442 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:36,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:36,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:36,442 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:36,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:36,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1624167897, now seen corresponding path program 1 times [2025-04-29 11:11:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:36,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395263987] [2025-04-29 11:11:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:36,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:36,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:36,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:36,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395263987] [2025-04-29 11:11:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395263987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:36,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941773454] [2025-04-29 11:11:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:36,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:36,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:36,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:36,489 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-04-29 11:11:36,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 140 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:36,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-04-29 11:11:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:38,142 INFO L116 PetriNetUnfolderBase]: 7632/23894 cut-off events. [2025-04-29 11:11:38,143 INFO L117 PetriNetUnfolderBase]: For 2760/2848 co-relation queries the response was YES. [2025-04-29 11:11:38,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35889 conditions, 23894 events. 7632/23894 cut-off events. For 2760/2848 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 284745 event pairs, 4688 based on Foata normal form. 3/21133 useless extension candidates. Maximal degree in co-relation 35344. Up to 8983 conditions per place. [2025-04-29 11:11:38,279 INFO L140 encePairwiseOnDemand]: 169/177 looper letters, 36 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2025-04-29 11:11:38,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 158 transitions, 465 flow [2025-04-29 11:11:38,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-04-29 11:11:38,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8851224105461394 [2025-04-29 11:11:38,282 INFO L175 Difference]: Start difference. First operand has 147 places, 140 transitions, 323 flow. Second operand 3 states and 470 transitions. [2025-04-29 11:11:38,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 158 transitions, 465 flow [2025-04-29 11:11:38,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 158 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:38,290 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 371 flow [2025-04-29 11:11:38,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-04-29 11:11:38,292 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 3 predicate places. [2025-04-29 11:11:38,292 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 371 flow [2025-04-29 11:11:38,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:38,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:38,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:11:38,293 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:38,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2073439806, now seen corresponding path program 1 times [2025-04-29 11:11:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:38,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216304056] [2025-04-29 11:11:38,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:38,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:38,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216304056] [2025-04-29 11:11:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216304056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:38,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003433925] [2025-04-29 11:11:38,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:38,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:38,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:38,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:38,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 177 [2025-04-29 11:11:38,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:38,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 177 [2025-04-29 11:11:38,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:40,013 INFO L116 PetriNetUnfolderBase]: 4543/18574 cut-off events. [2025-04-29 11:11:40,013 INFO L117 PetriNetUnfolderBase]: For 1934/2090 co-relation queries the response was YES. [2025-04-29 11:11:40,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27206 conditions, 18574 events. 4543/18574 cut-off events. For 1934/2090 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 225889 event pairs, 1506 based on Foata normal form. 3/15942 useless extension candidates. Maximal degree in co-relation 7596. Up to 2942 conditions per place. [2025-04-29 11:11:40,123 INFO L140 encePairwiseOnDemand]: 170/177 looper letters, 41 selfloop transitions, 7 changer transitions 0/168 dead transitions. [2025-04-29 11:11:40,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 168 transitions, 513 flow [2025-04-29 11:11:40,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1057 transitions. [2025-04-29 11:11:40,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8531073446327684 [2025-04-29 11:11:40,125 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 371 flow. Second operand 7 states and 1057 transitions. [2025-04-29 11:11:40,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 168 transitions, 513 flow [2025-04-29 11:11:40,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 168 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:40,135 INFO L231 Difference]: Finished difference. Result has 156 places, 149 transitions, 393 flow [2025-04-29 11:11:40,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=156, PETRI_TRANSITIONS=149} [2025-04-29 11:11:40,135 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 10 predicate places. [2025-04-29 11:11:40,135 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 149 transitions, 393 flow [2025-04-29 11:11:40,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:40,136 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:40,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:11:40,136 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:40,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1319758549, now seen corresponding path program 1 times [2025-04-29 11:11:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:40,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717183899] [2025-04-29 11:11:40,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:40,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:40,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717183899] [2025-04-29 11:11:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717183899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108034297] [2025-04-29 11:11:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:40,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:40,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:40,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:40,182 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-04-29 11:11:40,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 149 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:40,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-04-29 11:11:40,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:42,574 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L39-->L39-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [107#L39-1true, 79#L18-6true, Black: 207#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 217#true, Black: 213#(and (= |ULTIMATE.start_main_#t~post7#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 182#true, 140#L18-6true, 185#true, 39#L17-3true, Black: 197#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 206#(= 4 |ULTIMATE.start_main_~threads_total~0#1|), 184#true, Black: 209#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 201#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|)]) [2025-04-29 11:11:42,575 INFO L286 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L39-->L39-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [107#L39-1true, 79#L18-6true, Black: 207#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 217#true, 10#$Ultimate##0true, Black: 213#(and (= |ULTIMATE.start_main_#t~post7#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 182#true, 140#L18-6true, 185#true, Black: 197#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 206#(= 4 |ULTIMATE.start_main_~threads_total~0#1|), 184#true, Black: 209#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 201#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|)]) [2025-04-29 11:11:42,575 INFO L286 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-04-29 11:11:42,575 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L39-->L39-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [107#L39-1true, 79#L18-6true, 108#L18-5true, Black: 207#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 217#true, Black: 213#(and (= |ULTIMATE.start_main_#t~post7#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 182#true, 140#L18-6true, 185#true, Black: 197#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 206#(= 4 |ULTIMATE.start_main_~threads_total~0#1|), 184#true, Black: 209#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 201#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|)]) [2025-04-29 11:11:42,931 INFO L286 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([445] L39-->L39-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [79#L18-6true, 107#L39-1true, Black: 207#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 125#L19-3true, 217#true, Black: 213#(and (= |ULTIMATE.start_main_#t~post7#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 182#true, 140#L18-6true, 185#true, Black: 197#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 206#(= 4 |ULTIMATE.start_main_~threads_total~0#1|), 184#true, Black: 209#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 201#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|)]) [2025-04-29 11:11:42,931 INFO L286 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-29 11:11:42,931 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-29 11:11:43,578 INFO L116 PetriNetUnfolderBase]: 13096/40133 cut-off events. [2025-04-29 11:11:43,578 INFO L117 PetriNetUnfolderBase]: For 9630/10383 co-relation queries the response was YES. [2025-04-29 11:11:43,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67556 conditions, 40133 events. 13096/40133 cut-off events. For 9630/10383 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 515660 event pairs, 6801 based on Foata normal form. 29/35208 useless extension candidates. Maximal degree in co-relation 66468. Up to 14649 conditions per place. [2025-04-29 11:11:43,801 INFO L140 encePairwiseOnDemand]: 169/177 looper letters, 38 selfloop transitions, 11 changer transitions 0/169 dead transitions. [2025-04-29 11:11:43,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 169 transitions, 560 flow [2025-04-29 11:11:43,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2025-04-29 11:11:43,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8832391713747646 [2025-04-29 11:11:43,802 INFO L175 Difference]: Start difference. First operand has 156 places, 149 transitions, 393 flow. Second operand 3 states and 469 transitions. [2025-04-29 11:11:43,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 169 transitions, 560 flow [2025-04-29 11:11:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 169 transitions, 550 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:43,820 INFO L231 Difference]: Finished difference. Result has 157 places, 158 transitions, 479 flow [2025-04-29 11:11:43,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=157, PETRI_TRANSITIONS=158} [2025-04-29 11:11:43,821 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 11 predicate places. [2025-04-29 11:11:43,822 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 158 transitions, 479 flow [2025-04-29 11:11:43,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:43,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:43,822 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:43,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:11:43,822 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:43,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1004739680, now seen corresponding path program 1 times [2025-04-29 11:11:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:43,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928487797] [2025-04-29 11:11:43,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:43,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:43,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:43,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:43,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928487797] [2025-04-29 11:11:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928487797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617689693] [2025-04-29 11:11:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:43,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:43,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:43,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:43,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:43,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 177 [2025-04-29 11:11:43,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 158 transitions, 479 flow. Second operand has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:43,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:43,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 177 [2025-04-29 11:11:43,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:46,083 INFO L116 PetriNetUnfolderBase]: 7131/27161 cut-off events. [2025-04-29 11:11:46,083 INFO L117 PetriNetUnfolderBase]: For 6182/13346 co-relation queries the response was YES. [2025-04-29 11:11:46,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44706 conditions, 27161 events. 7131/27161 cut-off events. For 6182/13346 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 347707 event pairs, 1446 based on Foata normal form. 31/23142 useless extension candidates. Maximal degree in co-relation 18104. Up to 3925 conditions per place. [2025-04-29 11:11:46,319 INFO L140 encePairwiseOnDemand]: 170/177 looper letters, 53 selfloop transitions, 10 changer transitions 0/192 dead transitions. [2025-04-29 11:11:46,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 192 transitions, 677 flow [2025-04-29 11:11:46,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1504 transitions. [2025-04-29 11:11:46,322 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8497175141242937 [2025-04-29 11:11:46,322 INFO L175 Difference]: Start difference. First operand has 157 places, 158 transitions, 479 flow. Second operand 10 states and 1504 transitions. [2025-04-29 11:11:46,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 192 transitions, 677 flow [2025-04-29 11:11:46,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 192 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:46,343 INFO L231 Difference]: Finished difference. Result has 167 places, 160 transitions, 497 flow [2025-04-29 11:11:46,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=497, PETRI_PLACES=167, PETRI_TRANSITIONS=160} [2025-04-29 11:11:46,344 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 21 predicate places. [2025-04-29 11:11:46,344 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 160 transitions, 497 flow [2025-04-29 11:11:46,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.625) internal successors, (1165), 8 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:46,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:46,345 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:46,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:46,345 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:46,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -280534977, now seen corresponding path program 1 times [2025-04-29 11:11:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:46,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862921427] [2025-04-29 11:11:46,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:46,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:46,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862921427] [2025-04-29 11:11:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862921427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:46,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837201493] [2025-04-29 11:11:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:46,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:46,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:46,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:46,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 177 [2025-04-29 11:11:46,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 160 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:46,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:46,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 177 [2025-04-29 11:11:46,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:46,768 INFO L116 PetriNetUnfolderBase]: 507/5200 cut-off events. [2025-04-29 11:11:46,768 INFO L117 PetriNetUnfolderBase]: For 944/1050 co-relation queries the response was YES. [2025-04-29 11:11:46,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 5200 events. 507/5200 cut-off events. For 944/1050 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 56150 event pairs, 274 based on Foata normal form. 122/4774 useless extension candidates. Maximal degree in co-relation 7352. Up to 545 conditions per place. [2025-04-29 11:11:46,788 INFO L140 encePairwiseOnDemand]: 169/177 looper letters, 16 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2025-04-29 11:11:46,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 158 transitions, 528 flow [2025-04-29 11:11:46,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-04-29 11:11:46,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.911487758945386 [2025-04-29 11:11:46,789 INFO L175 Difference]: Start difference. First operand has 167 places, 160 transitions, 497 flow. Second operand 3 states and 484 transitions. [2025-04-29 11:11:46,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 158 transitions, 528 flow [2025-04-29 11:11:46,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 158 transitions, 502 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:46,800 INFO L231 Difference]: Finished difference. Result has 163 places, 151 transitions, 433 flow [2025-04-29 11:11:46,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=163, PETRI_TRANSITIONS=151} [2025-04-29 11:11:46,800 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 17 predicate places. [2025-04-29 11:11:46,800 INFO L485 AbstractCegarLoop]: Abstraction has has 163 places, 151 transitions, 433 flow [2025-04-29 11:11:46,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:46,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:46,801 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:11:46,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:46,801 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:46,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1425420536, now seen corresponding path program 1 times [2025-04-29 11:11:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:46,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525470063] [2025-04-29 11:11:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:46,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:11:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:11:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:46,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525470063] [2025-04-29 11:11:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525470063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:46,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:46,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:46,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653219700] [2025-04-29 11:11:46,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:46,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:46,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:46,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:46,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 177 [2025-04-29 11:11:46,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 151 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:46,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:46,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 177 [2025-04-29 11:11:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:47,263 INFO L116 PetriNetUnfolderBase]: 1009/6369 cut-off events. [2025-04-29 11:11:47,263 INFO L117 PetriNetUnfolderBase]: For 2996/2996 co-relation queries the response was YES. [2025-04-29 11:11:47,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10914 conditions, 6369 events. 1009/6369 cut-off events. For 2996/2996 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 70812 event pairs, 785 based on Foata normal form. 0/5742 useless extension candidates. Maximal degree in co-relation 10619. Up to 1702 conditions per place. [2025-04-29 11:11:47,289 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 30 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2025-04-29 11:11:47,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 527 flow [2025-04-29 11:11:47,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2025-04-29 11:11:47,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.864406779661017 [2025-04-29 11:11:47,291 INFO L175 Difference]: Start difference. First operand has 163 places, 151 transitions, 433 flow. Second operand 3 states and 459 transitions. [2025-04-29 11:11:47,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 527 flow [2025-04-29 11:11:47,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 158 transitions, 519 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:47,294 INFO L231 Difference]: Finished difference. Result has 166 places, 154 transitions, 459 flow [2025-04-29 11:11:47,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=166, PETRI_TRANSITIONS=154} [2025-04-29 11:11:47,295 INFO L279 CegarLoopForPetriNet]: 146 programPoint places, 20 predicate places. [2025-04-29 11:11:47,295 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 154 transitions, 459 flow [2025-04-29 11:11:47,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:47,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:47,295 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:47,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:47,295 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:47,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 48838704, now seen corresponding path program 1 times [2025-04-29 11:11:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:47,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443797533] [2025-04-29 11:11:47,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:47,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:47,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:47,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:47,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:47,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:47,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:47,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:47,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:47,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:47,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:47,328 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-04-29 11:11:47,329 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-04-29 11:11:47,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:47,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:47,331 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:47,331 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:11:47,355 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-29 11:11:47,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 213 transitions, 506 flow [2025-04-29 11:11:47,414 INFO L116 PetriNetUnfolderBase]: 53/1136 cut-off events. [2025-04-29 11:11:47,414 INFO L117 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-04-29 11:11:47,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 1136 events. 53/1136 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5741 event pairs, 23 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1240. Up to 80 conditions per place. [2025-04-29 11:11:47,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 213 transitions, 506 flow [2025-04-29 11:11:47,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 158 transitions, 362 flow [2025-04-29 11:11:47,420 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:47,420 INFO L340 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;@37878b2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:47,420 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:11:47,421 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:47,421 INFO L116 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-04-29 11:11:47,421 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:47,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:47,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:47,422 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:11:47,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1240574793, now seen corresponding path program 1 times [2025-04-29 11:11:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:47,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019459220] [2025-04-29 11:11:47,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:47,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:47,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:47,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019459220] [2025-04-29 11:11:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019459220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:47,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677987223] [2025-04-29 11:11:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:47,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:47,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:47,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:47,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 213 [2025-04-29 11:11:47,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:47,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:47,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 213 [2025-04-29 11:11:47,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:52,715 INFO L116 PetriNetUnfolderBase]: 22557/56230 cut-off events. [2025-04-29 11:11:52,715 INFO L117 PetriNetUnfolderBase]: For 4405/4405 co-relation queries the response was YES. [2025-04-29 11:11:52,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89440 conditions, 56230 events. 22557/56230 cut-off events. For 4405/4405 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 672228 event pairs, 4473 based on Foata normal form. 0/51739 useless extension candidates. Maximal degree in co-relation 21203. Up to 29151 conditions per place. [2025-04-29 11:11:53,013 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 69 selfloop transitions, 5 changer transitions 0/189 dead transitions. [2025-04-29 11:11:53,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 189 transitions, 572 flow [2025-04-29 11:11:53,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1023 transitions. [2025-04-29 11:11:53,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8004694835680751 [2025-04-29 11:11:53,015 INFO L175 Difference]: Start difference. First operand has 165 places, 158 transitions, 362 flow. Second operand 6 states and 1023 transitions. [2025-04-29 11:11:53,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 189 transitions, 572 flow [2025-04-29 11:11:53,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 189 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:53,021 INFO L231 Difference]: Finished difference. Result has 167 places, 157 transitions, 366 flow [2025-04-29 11:11:53,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=167, PETRI_TRANSITIONS=157} [2025-04-29 11:11:53,021 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 2 predicate places. [2025-04-29 11:11:53,022 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 157 transitions, 366 flow [2025-04-29 11:11:53,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:53,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:53,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:53,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:53,022 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:11:53,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash -218379935, now seen corresponding path program 1 times [2025-04-29 11:11:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:53,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527324555] [2025-04-29 11:11:53,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:53,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:11:53,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:11:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:53,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527324555] [2025-04-29 11:11:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527324555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215578244] [2025-04-29 11:11:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:53,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:53,069 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 213 [2025-04-29 11:11:53,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 157 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:53,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:53,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 213 [2025-04-29 11:11:53,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,582 INFO L116 PetriNetUnfolderBase]: 6972/24636 cut-off events. [2025-04-29 11:11:55,582 INFO L117 PetriNetUnfolderBase]: For 4016/4016 co-relation queries the response was YES. [2025-04-29 11:11:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35741 conditions, 24636 events. 6972/24636 cut-off events. For 4016/4016 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 289702 event pairs, 3030 based on Foata normal form. 1/22358 useless extension candidates. Maximal degree in co-relation 11578. Up to 5914 conditions per place. [2025-04-29 11:11:55,701 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 36 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2025-04-29 11:11:55,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 170 transitions, 472 flow [2025-04-29 11:11:55,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions. [2025-04-29 11:11:55,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8650234741784038 [2025-04-29 11:11:55,702 INFO L175 Difference]: Start difference. First operand has 167 places, 157 transitions, 366 flow. Second operand 4 states and 737 transitions. [2025-04-29 11:11:55,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 170 transitions, 472 flow [2025-04-29 11:11:55,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 170 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:55,706 INFO L231 Difference]: Finished difference. Result has 166 places, 158 transitions, 372 flow [2025-04-29 11:11:55,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=166, PETRI_TRANSITIONS=158} [2025-04-29 11:11:55,706 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2025-04-29 11:11:55,706 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 158 transitions, 372 flow [2025-04-29 11:11:55,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:55,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:11:55,707 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:11:55,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1161645363, now seen corresponding path program 1 times [2025-04-29 11:11:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271302806] [2025-04-29 11:11:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:55,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:55,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:55,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271302806] [2025-04-29 11:11:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271302806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:55,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648642876] [2025-04-29 11:11:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:55,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:55,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:55,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:55,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2025-04-29 11:11:55,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 158 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:55,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2025-04-29 11:11:55,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:07,474 INFO L116 PetriNetUnfolderBase]: 48692/131005 cut-off events. [2025-04-29 11:12:07,474 INFO L117 PetriNetUnfolderBase]: For 18996/19184 co-relation queries the response was YES. [2025-04-29 11:12:07,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202583 conditions, 131005 events. 48692/131005 cut-off events. For 18996/19184 co-relation queries the response was YES. Maximal size of possible extension queue 3587. Compared 1826231 event pairs, 31881 based on Foata normal form. 4/117264 useless extension candidates. Maximal degree in co-relation 200420. Up to 54011 conditions per place. [2025-04-29 11:12:08,499 INFO L140 encePairwiseOnDemand]: 204/213 looper letters, 45 selfloop transitions, 8 changer transitions 0/181 dead transitions. [2025-04-29 11:12:08,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 181 transitions, 556 flow [2025-04-29 11:12:08,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2025-04-29 11:12:08,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8732394366197183 [2025-04-29 11:12:08,501 INFO L175 Difference]: Start difference. First operand has 166 places, 158 transitions, 372 flow. Second operand 3 states and 558 transitions. [2025-04-29 11:12:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 181 transitions, 556 flow [2025-04-29 11:12:08,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 181 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:08,601 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 428 flow [2025-04-29 11:12:08,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2025-04-29 11:12:08,602 INFO L279 CegarLoopForPetriNet]: 165 programPoint places, 3 predicate places. [2025-04-29 11:12:08,602 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 428 flow [2025-04-29 11:12:08,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:08,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:08,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:08,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:12:08,602 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:12:08,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash 45625698, now seen corresponding path program 1 times [2025-04-29 11:12:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:08,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505325657] [2025-04-29 11:12:08,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:08,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:12:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:12:08,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:12:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:08,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505325657] [2025-04-29 11:12:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505325657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880531815] [2025-04-29 11:12:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:08,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:08,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:08,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 213 [2025-04-29 11:12:08,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 428 flow. Second operand has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:08,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:08,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 213 [2025-04-29 11:12:08,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand