./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-2.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-2.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 84a81a15ff7520323cec1cf633cdab4ff5881c22e3eff73a7df5f61f72612544 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:23,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:23,380 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:23,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:23,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:23,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:23,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:23,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:23,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:23,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:23,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:23,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:23,412 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:23,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:23,413 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:23,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:23,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:23,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:23,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:23,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:23,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:23,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:23,416 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 -> 84a81a15ff7520323cec1cf633cdab4ff5881c22e3eff73a7df5f61f72612544 [2025-04-29 11:11:23,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:23,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:23,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:23,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:23,674 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:23,675 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-2.c [2025-04-29 11:11:24,872 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f643411/5c30fdf2751143239856074a46b093db/FLAG89df59fd7 [2025-04-29 11:11:25,075 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:25,081 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const-race-2.c [2025-04-29 11:11:25,082 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:25,105 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f643411/5c30fdf2751143239856074a46b093db/FLAG89df59fd7 [2025-04-29 11:11:25,923 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f643411/5c30fdf2751143239856074a46b093db [2025-04-29 11:11:25,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:25,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:25,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:25,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:25,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:25,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:25" (1/1) ... [2025-04-29 11:11:25,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c986516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:25, skipping insertion in model container [2025-04-29 11:11:25,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:25" (1/1) ... [2025-04-29 11:11:25,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:26,110 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:26,119 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:26,154 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:26,170 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:26,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:26 WrapperNode [2025-04-29 11:11:26,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:26,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:26,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:26,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:26,176 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:26" (1/1) ... [2025-04-29 11:11:26,183 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:26" (1/1) ... [2025-04-29 11:11:26,197 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-04-29 11:11:26,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:26,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:26,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:26,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:26,204 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:26" (1/1) ... [2025-04-29 11:11:26,204 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:26" (1/1) ... [2025-04-29 11:11:26,211 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:26" (1/1) ... [2025-04-29 11:11:26,211 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:26" (1/1) ... [2025-04-29 11:11:26,216 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:26" (1/1) ... [2025-04-29 11:11:26,217 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:26" (1/1) ... [2025-04-29 11:11:26,218 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:26" (1/1) ... [2025-04-29 11:11:26,219 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:26" (1/1) ... [2025-04-29 11:11:26,219 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:26" (1/1) ... [2025-04-29 11:11:26,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:26,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:26,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:26,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:26,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:26" (1/1) ... [2025-04-29 11:11:26,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:26,249 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:26,254 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:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:26,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:11:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:26,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:26,269 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:26,327 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:26,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:26,445 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:26,445 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:26,462 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:26,462 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:26,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:26 BoogieIcfgContainer [2025-04-29 11:11:26,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:26,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:26,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:26,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:26,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:25" (1/3) ... [2025-04-29 11:11:26,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc8a892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:26, skipping insertion in model container [2025-04-29 11:11:26,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:26" (2/3) ... [2025-04-29 11:11:26,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc8a892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:26, skipping insertion in model container [2025-04-29 11:11:26,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:26" (3/3) ... [2025-04-29 11:11:26,471 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.c [2025-04-29 11:11:26,481 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:26,483 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const-race-2.c that has 2 procedures, 70 locations, 70 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:11:26,483 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:26,524 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:26,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 71 transitions, 149 flow [2025-04-29 11:11:26,596 INFO L116 PetriNetUnfolderBase]: 1/104 cut-off events. [2025-04-29 11:11:26,598 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 104 events. 1/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 207 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 2. Up to 3 conditions per place. [2025-04-29 11:11:26,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 71 transitions, 149 flow [2025-04-29 11:11:26,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 149 flow [2025-04-29 11:11:26,608 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:26,615 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;@221ac717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:26,617 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:11:26,623 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:26,623 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:26,623 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:26,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:26,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:26,627 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:26,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -378851860, now seen corresponding path program 1 times [2025-04-29 11:11:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:26,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868956388] [2025-04-29 11:11:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:26,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:26,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:26,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:26,802 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:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:26,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868956388] [2025-04-29 11:11:26,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868956388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:26,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:26,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105589849] [2025-04-29 11:11:26,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:26,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:26,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:26,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:26,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 71 [2025-04-29 11:11:26,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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:26,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:26,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 71 [2025-04-29 11:11:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:26,953 INFO L116 PetriNetUnfolderBase]: 8/171 cut-off events. [2025-04-29 11:11:26,954 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 171 events. 8/171 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 521 event pairs, 2 based on Foata normal form. 1/153 useless extension candidates. Maximal degree in co-relation 146. Up to 17 conditions per place. [2025-04-29 11:11:26,956 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 10 selfloop transitions, 4 changer transitions 1/75 dead transitions. [2025-04-29 11:11:26,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 187 flow [2025-04-29 11:11:26,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-04-29 11:11:26,971 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9014084507042254 [2025-04-29 11:11:26,972 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 149 flow. Second operand 4 states and 256 transitions. [2025-04-29 11:11:26,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 187 flow [2025-04-29 11:11:26,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 187 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:26,981 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 161 flow [2025-04-29 11:11:26,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2025-04-29 11:11:26,987 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-04-29 11:11:26,988 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 161 flow [2025-04-29 11:11:26,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 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:26,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:26,989 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:26,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:26,989 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:26,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1624643524, now seen corresponding path program 1 times [2025-04-29 11:11:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:26,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638259824] [2025-04-29 11:11:26,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:26,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:27,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:27,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,354 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:27,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638259824] [2025-04-29 11:11:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638259824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585120346] [2025-04-29 11:11:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:27,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:27,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 71 [2025-04-29 11:11:27,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 71 [2025-04-29 11:11:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,536 INFO L116 PetriNetUnfolderBase]: 30/205 cut-off events. [2025-04-29 11:11:27,536 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-29 11:11:27,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 205 events. 30/205 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 848 event pairs, 4 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 247. Up to 62 conditions per place. [2025-04-29 11:11:27,538 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-04-29 11:11:27,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 235 flow [2025-04-29 11:11:27,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 319 transitions. [2025-04-29 11:11:27,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7488262910798122 [2025-04-29 11:11:27,541 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 161 flow. Second operand 6 states and 319 transitions. [2025-04-29 11:11:27,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 235 flow [2025-04-29 11:11:27,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:27,545 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 161 flow [2025-04-29 11:11:27,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-04-29 11:11:27,546 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-04-29 11:11:27,546 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 161 flow [2025-04-29 11:11:27,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:27,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,546 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:27,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:27,546 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:27,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1837821520, now seen corresponding path program 1 times [2025-04-29 11:11:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26228257] [2025-04-29 11:11:27,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:27,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:27,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,598 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:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26228257] [2025-04-29 11:11:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26228257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968894758] [2025-04-29 11:11:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:27,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:27,608 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 71 [2025-04-29 11:11:27,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:27,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 71 [2025-04-29 11:11:27,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,633 INFO L116 PetriNetUnfolderBase]: 6/137 cut-off events. [2025-04-29 11:11:27,633 INFO L117 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-04-29 11:11:27,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 137 events. 6/137 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 367 event pairs, 4 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 134. Up to 21 conditions per place. [2025-04-29 11:11:27,634 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 9 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2025-04-29 11:11:27,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 193 flow [2025-04-29 11:11:27,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2025-04-29 11:11:27,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9248826291079812 [2025-04-29 11:11:27,636 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 161 flow. Second operand 3 states and 197 transitions. [2025-04-29 11:11:27,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 193 flow [2025-04-29 11:11:27,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 183 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:27,638 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 181 flow [2025-04-29 11:11:27,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-04-29 11:11:27,638 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-04-29 11:11:27,639 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 181 flow [2025-04-29 11:11:27,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:27,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,639 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] [2025-04-29 11:11:27,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:27,639 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:27,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 629398825, now seen corresponding path program 1 times [2025-04-29 11:11:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407996882] [2025-04-29 11:11:27,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,700 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:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407996882] [2025-04-29 11:11:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407996882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324355565] [2025-04-29 11:11:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:27,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:27,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 71 [2025-04-29 11:11:27,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:27,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 71 [2025-04-29 11:11:27,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,760 INFO L116 PetriNetUnfolderBase]: 2/102 cut-off events. [2025-04-29 11:11:27,760 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:27,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 102 events. 2/102 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 81. Up to 7 conditions per place. [2025-04-29 11:11:27,761 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 9 selfloop transitions, 3 changer transitions 7/71 dead transitions. [2025-04-29 11:11:27,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 191 flow [2025-04-29 11:11:27,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-04-29 11:11:27,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8943661971830986 [2025-04-29 11:11:27,762 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 181 flow. Second operand 4 states and 254 transitions. [2025-04-29 11:11:27,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 191 flow [2025-04-29 11:11:27,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 179 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:27,763 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 145 flow [2025-04-29 11:11:27,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2025-04-29 11:11:27,764 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2025-04-29 11:11:27,764 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 145 flow [2025-04-29 11:11:27,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:27,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,764 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] [2025-04-29 11:11:27,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:27,765 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:27,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 129572291, now seen corresponding path program 1 times [2025-04-29 11:11:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47454246] [2025-04-29 11:11:27,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:27,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:27,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:27,851 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:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:27,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47454246] [2025-04-29 11:11:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47454246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:27,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:27,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594655856] [2025-04-29 11:11:27,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:27,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:27,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:27,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:27,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:27,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 71 [2025-04-29 11:11:27,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:27,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:27,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 71 [2025-04-29 11:11:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:27,941 INFO L116 PetriNetUnfolderBase]: 6/94 cut-off events. [2025-04-29 11:11:27,941 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:11:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 94 events. 6/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 0 based on Foata normal form. 3/96 useless extension candidates. Maximal degree in co-relation 121. Up to 5 conditions per place. [2025-04-29 11:11:27,942 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 10 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-04-29 11:11:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 138 flow [2025-04-29 11:11:27,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 422 transitions. [2025-04-29 11:11:27,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8490945674044266 [2025-04-29 11:11:27,943 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 145 flow. Second operand 7 states and 422 transitions. [2025-04-29 11:11:27,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 138 flow [2025-04-29 11:11:27,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:27,944 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 103 flow [2025-04-29 11:11:27,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-04-29 11:11:27,945 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -18 predicate places. [2025-04-29 11:11:27,945 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 103 flow [2025-04-29 11:11:27,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:27,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:27,946 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:27,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:27,946 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:27,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1536682190, now seen corresponding path program 1 times [2025-04-29 11:11:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:27,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051664409] [2025-04-29 11:11:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:27,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:27,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:27,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:27,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:27,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:27,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:27,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:27,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:27,983 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-29 11:11:27,985 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-29 11:11:27,985 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-29 11:11:27,985 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-29 11:11:27,985 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-29 11:11:27,985 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-29 11:11:27,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:27,986 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:11:27,987 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:27,987 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:28,001 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:28,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 194 flow [2025-04-29 11:11:28,019 INFO L116 PetriNetUnfolderBase]: 3/186 cut-off events. [2025-04-29 11:11:28,019 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:28,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 186 events. 3/186 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 435 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 106. Up to 6 conditions per place. [2025-04-29 11:11:28,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 89 transitions, 194 flow [2025-04-29 11:11:28,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 194 flow [2025-04-29 11:11:28,021 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:28,021 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;@221ac717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:28,021 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:11:28,023 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:28,024 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:28,024 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:28,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:28,024 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:28,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1840345612, now seen corresponding path program 1 times [2025-04-29 11:11:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101473914] [2025-04-29 11:11:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:28,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:28,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,061 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:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101473914] [2025-04-29 11:11:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101473914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447885493] [2025-04-29 11:11:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:28,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-04-29 11:11:28,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:28,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-04-29 11:11:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:28,152 INFO L116 PetriNetUnfolderBase]: 72/607 cut-off events. [2025-04-29 11:11:28,153 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-29 11:11:28,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 607 events. 72/607 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3646 event pairs, 20 based on Foata normal form. 1/552 useless extension candidates. Maximal degree in co-relation 209. Up to 106 conditions per place. [2025-04-29 11:11:28,158 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 18 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-04-29 11:11:28,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 252 flow [2025-04-29 11:11:28,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-04-29 11:11:28,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8960674157303371 [2025-04-29 11:11:28,160 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 4 states and 319 transitions. [2025-04-29 11:11:28,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 252 flow [2025-04-29 11:11:28,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:28,162 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 210 flow [2025-04-29 11:11:28,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2025-04-29 11:11:28,163 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 4 predicate places. [2025-04-29 11:11:28,163 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 210 flow [2025-04-29 11:11:28,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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:28,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,163 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:28,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:28,163 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:28,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1944254123, now seen corresponding path program 1 times [2025-04-29 11:11:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082932495] [2025-04-29 11:11:28,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:28,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:28,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,331 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:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082932495] [2025-04-29 11:11:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082932495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938111720] [2025-04-29 11:11:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:28,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:28,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 89 [2025-04-29 11:11:28,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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:28,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 89 [2025-04-29 11:11:28,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:28,548 INFO L116 PetriNetUnfolderBase]: 236/937 cut-off events. [2025-04-29 11:11:28,549 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-29 11:11:28,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 937 events. 236/937 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6561 event pairs, 91 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 443. Up to 313 conditions per place. [2025-04-29 11:11:28,555 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 38 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-04-29 11:11:28,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 326 flow [2025-04-29 11:11:28,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2025-04-29 11:11:28,559 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7771535580524345 [2025-04-29 11:11:28,559 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 210 flow. Second operand 6 states and 415 transitions. [2025-04-29 11:11:28,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 326 flow [2025-04-29 11:11:28,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:28,561 INFO L231 Difference]: Finished difference. Result has 98 places, 89 transitions, 212 flow [2025-04-29 11:11:28,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2025-04-29 11:11:28,564 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 6 predicate places. [2025-04-29 11:11:28,564 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 212 flow [2025-04-29 11:11:28,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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:28,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,565 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:28,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:28,565 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:28,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -397754951, now seen corresponding path program 1 times [2025-04-29 11:11:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717217462] [2025-04-29 11:11:28,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:28,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,597 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:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717217462] [2025-04-29 11:11:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717217462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260292953] [2025-04-29 11:11:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:28,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:28,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-04-29 11:11:28,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:28,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-04-29 11:11:28,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:28,702 INFO L116 PetriNetUnfolderBase]: 113/662 cut-off events. [2025-04-29 11:11:28,702 INFO L117 PetriNetUnfolderBase]: For 90/135 co-relation queries the response was YES. [2025-04-29 11:11:28,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 662 events. 113/662 cut-off events. For 90/135 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4260 event pairs, 73 based on Foata normal form. 3/586 useless extension candidates. Maximal degree in co-relation 720. Up to 182 conditions per place. [2025-04-29 11:11:28,705 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 18 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2025-04-29 11:11:28,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 282 flow [2025-04-29 11:11:28,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-04-29 11:11:28,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9213483146067416 [2025-04-29 11:11:28,707 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 212 flow. Second operand 3 states and 246 transitions. [2025-04-29 11:11:28,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 282 flow [2025-04-29 11:11:28,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 272 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:28,710 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 240 flow [2025-04-29 11:11:28,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2025-04-29 11:11:28,713 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2025-04-29 11:11:28,713 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 240 flow [2025-04-29 11:11:28,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:28,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,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, 1, 1, 1, 1] [2025-04-29 11:11:28,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:28,714 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:28,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1816813998, now seen corresponding path program 1 times [2025-04-29 11:11:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284673713] [2025-04-29 11:11:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:28,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:28,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,761 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:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284673713] [2025-04-29 11:11:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284673713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430169333] [2025-04-29 11:11:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:28,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:28,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-04-29 11:11:28,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 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:28,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:28,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-04-29 11:11:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:28,880 INFO L116 PetriNetUnfolderBase]: 63/576 cut-off events. [2025-04-29 11:11:28,880 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-29 11:11:28,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 576 events. 63/576 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3194 event pairs, 24 based on Foata normal form. 15/540 useless extension candidates. Maximal degree in co-relation 632. Up to 72 conditions per place. [2025-04-29 11:11:28,885 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 19 selfloop transitions, 4 changer transitions 3/104 dead transitions. [2025-04-29 11:11:28,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 104 transitions, 320 flow [2025-04-29 11:11:28,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2025-04-29 11:11:28,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9073033707865169 [2025-04-29 11:11:28,886 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 240 flow. Second operand 4 states and 323 transitions. [2025-04-29 11:11:28,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 104 transitions, 320 flow [2025-04-29 11:11:28,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:28,890 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 246 flow [2025-04-29 11:11:28,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2025-04-29 11:11:28,891 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 7 predicate places. [2025-04-29 11:11:28,892 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 246 flow [2025-04-29 11:11:28,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 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:28,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:28,892 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] [2025-04-29 11:11:28,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:28,893 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:28,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2008529203, now seen corresponding path program 1 times [2025-04-29 11:11:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:28,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984095579] [2025-04-29 11:11:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:28,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:28,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:28,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:28,975 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:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:28,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984095579] [2025-04-29 11:11:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984095579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418779952] [2025-04-29 11:11:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:28,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:28,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:28,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:29,019 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-04-29 11:11:29,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 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:29,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:29,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-04-29 11:11:29,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:29,152 INFO L116 PetriNetUnfolderBase]: 117/865 cut-off events. [2025-04-29 11:11:29,152 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-29 11:11:29,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 865 events. 117/865 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5501 event pairs, 16 based on Foata normal form. 3/787 useless extension candidates. Maximal degree in co-relation 758. Up to 130 conditions per place. [2025-04-29 11:11:29,157 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 24 selfloop transitions, 7 changer transitions 3/110 dead transitions. [2025-04-29 11:11:29,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 110 transitions, 346 flow [2025-04-29 11:11:29,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 539 transitions. [2025-04-29 11:11:29,159 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8651685393258427 [2025-04-29 11:11:29,159 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 246 flow. Second operand 7 states and 539 transitions. [2025-04-29 11:11:29,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 110 transitions, 346 flow [2025-04-29 11:11:29,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 110 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:29,161 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 270 flow [2025-04-29 11:11:29,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2025-04-29 11:11:29,162 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 14 predicate places. [2025-04-29 11:11:29,162 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 270 flow [2025-04-29 11:11:29,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 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:29,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:29,162 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:29,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:29,162 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:29,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1420780446, now seen corresponding path program 1 times [2025-04-29 11:11:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:29,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886009727] [2025-04-29 11:11:29,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:29,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:29,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:29,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:29,199 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:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:29,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886009727] [2025-04-29 11:11:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886009727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326557898] [2025-04-29 11:11:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:29,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:29,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:29,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:29,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-04-29 11:11:29,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 96 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:29,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:29,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-04-29 11:11:29,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:29,275 INFO L116 PetriNetUnfolderBase]: 58/566 cut-off events. [2025-04-29 11:11:29,275 INFO L117 PetriNetUnfolderBase]: For 136/188 co-relation queries the response was YES. [2025-04-29 11:11:29,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 566 events. 58/566 cut-off events. For 136/188 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3250 event pairs, 32 based on Foata normal form. 3/523 useless extension candidates. Maximal degree in co-relation 758. Up to 111 conditions per place. [2025-04-29 11:11:29,278 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 18 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-04-29 11:11:29,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 339 flow [2025-04-29 11:11:29,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-04-29 11:11:29,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9176029962546817 [2025-04-29 11:11:29,279 INFO L175 Difference]: Start difference. First operand has 106 places, 96 transitions, 270 flow. Second operand 3 states and 245 transitions. [2025-04-29 11:11:29,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 339 flow [2025-04-29 11:11:29,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 329 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:29,281 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 306 flow [2025-04-29 11:11:29,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2025-04-29 11:11:29,281 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 15 predicate places. [2025-04-29 11:11:29,281 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 306 flow [2025-04-29 11:11:29,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:29,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:29,282 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] [2025-04-29 11:11:29,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:29,282 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:29,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2140478342, now seen corresponding path program 1 times [2025-04-29 11:11:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:29,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789166388] [2025-04-29 11:11:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:29,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:29,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:29,436 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:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:29,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789166388] [2025-04-29 11:11:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789166388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961017318] [2025-04-29 11:11:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:29,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:29,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-04-29 11:11:29,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 306 flow. Second operand has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 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:29,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-04-29 11:11:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:29,592 INFO L116 PetriNetUnfolderBase]: 68/438 cut-off events. [2025-04-29 11:11:29,593 INFO L117 PetriNetUnfolderBase]: For 89/93 co-relation queries the response was YES. [2025-04-29 11:11:29,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 438 events. 68/438 cut-off events. For 89/93 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2268 event pairs, 4 based on Foata normal form. 14/442 useless extension candidates. Maximal degree in co-relation 702. Up to 31 conditions per place. [2025-04-29 11:11:29,594 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 25 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-04-29 11:11:29,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 320 flow [2025-04-29 11:11:29,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 754 transitions. [2025-04-29 11:11:29,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8471910112359551 [2025-04-29 11:11:29,596 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 306 flow. Second operand 10 states and 754 transitions. [2025-04-29 11:11:29,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 320 flow [2025-04-29 11:11:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 89 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:29,598 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 220 flow [2025-04-29 11:11:29,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=220, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2025-04-29 11:11:29,600 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, -5 predicate places. [2025-04-29 11:11:29,600 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 220 flow [2025-04-29 11:11:29,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 73.625) internal successors, (589), 8 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:29,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:29,601 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:29,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:11:29,601 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:29,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash -115410592, now seen corresponding path program 1 times [2025-04-29 11:11:29,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:29,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926060915] [2025-04-29 11:11:29,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:29,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:29,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:29,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:29,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:29,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:29,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:29,636 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:29,636 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-29 11:11:29,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:11:29,637 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-29 11:11:29,637 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:11:29,637 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:11:29,637 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:11:29,637 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:11:29,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:11:29,637 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:29,637 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:29,637 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:11:29,649 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:11:29,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 241 flow [2025-04-29 11:11:29,664 INFO L116 PetriNetUnfolderBase]: 8/315 cut-off events. [2025-04-29 11:11:29,665 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:11:29,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 315 events. 8/315 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 923 event pairs, 1 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 194. Up to 12 conditions per place. [2025-04-29 11:11:29,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 107 transitions, 241 flow [2025-04-29 11:11:29,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 107 transitions, 241 flow [2025-04-29 11:11:29,667 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:29,667 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;@221ac717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:29,667 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-29 11:11:29,668 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:29,668 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:29,668 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:29,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:29,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:29,668 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:29,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 116886124, now seen corresponding path program 1 times [2025-04-29 11:11:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:29,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677368436] [2025-04-29 11:11:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:29,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:29,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:29,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:29,687 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:29,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:29,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677368436] [2025-04-29 11:11:29,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677368436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:29,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:29,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037906566] [2025-04-29 11:11:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:29,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:29,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:29,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:29,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2025-04-29 11:11:29,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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:29,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:29,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2025-04-29 11:11:29,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:29,868 INFO L116 PetriNetUnfolderBase]: 413/2175 cut-off events. [2025-04-29 11:11:29,868 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-29 11:11:29,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 2175 events. 413/2175 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 17342 event pairs, 232 based on Foata normal form. 1/1989 useless extension candidates. Maximal degree in co-relation 1327. Up to 496 conditions per place. [2025-04-29 11:11:29,881 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 24 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-04-29 11:11:29,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 315 flow [2025-04-29 11:11:29,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-04-29 11:11:29,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8901869158878505 [2025-04-29 11:11:29,882 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 241 flow. Second operand 4 states and 381 transitions. [2025-04-29 11:11:29,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 315 flow [2025-04-29 11:11:29,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 315 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:29,884 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 257 flow [2025-04-29 11:11:29,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-04-29 11:11:29,884 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2025-04-29 11:11:29,885 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 257 flow [2025-04-29 11:11:29,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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:29,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:29,885 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:29,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:11:29,885 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:29,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash 808268800, now seen corresponding path program 1 times [2025-04-29 11:11:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:29,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120473128] [2025-04-29 11:11:29,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:29,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:29,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:29,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:29,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:30,003 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:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:30,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120473128] [2025-04-29 11:11:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120473128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:30,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:30,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636517501] [2025-04-29 11:11:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:30,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:30,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:30,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 107 [2025-04-29 11:11:30,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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:30,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:30,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 107 [2025-04-29 11:11:30,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:30,412 INFO L116 PetriNetUnfolderBase]: 1295/3888 cut-off events. [2025-04-29 11:11:30,412 INFO L117 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2025-04-29 11:11:30,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6240 conditions, 3888 events. 1295/3888 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 34402 event pairs, 181 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 2049. Up to 1483 conditions per place. [2025-04-29 11:11:30,431 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 50 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2025-04-29 11:11:30,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 131 transitions, 413 flow [2025-04-29 11:11:30,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2025-04-29 11:11:30,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7959501557632399 [2025-04-29 11:11:30,434 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 257 flow. Second operand 6 states and 511 transitions. [2025-04-29 11:11:30,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 131 transitions, 413 flow [2025-04-29 11:11:30,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 131 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:30,436 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 259 flow [2025-04-29 11:11:30,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2025-04-29 11:11:30,438 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2025-04-29 11:11:30,438 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 259 flow [2025-04-29 11:11:30,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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:30,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:30,438 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:30,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:30,438 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:30,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1472027756, now seen corresponding path program 1 times [2025-04-29 11:11:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:30,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977510285] [2025-04-29 11:11:30,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:30,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:30,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:30,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:30,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:30,460 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:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:30,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977510285] [2025-04-29 11:11:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977510285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:30,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129412847] [2025-04-29 11:11:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:30,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:30,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:30,472 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-04-29 11:11:30,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:30,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:30,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-04-29 11:11:30,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:30,794 INFO L116 PetriNetUnfolderBase]: 1023/4155 cut-off events. [2025-04-29 11:11:30,794 INFO L117 PetriNetUnfolderBase]: For 713/975 co-relation queries the response was YES. [2025-04-29 11:11:30,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 4155 events. 1023/4155 cut-off events. For 713/975 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 39690 event pairs, 581 based on Foata normal form. 7/3613 useless extension candidates. Maximal degree in co-relation 2112. Up to 1329 conditions per place. [2025-04-29 11:11:30,821 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 27 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2025-04-29 11:11:30,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 369 flow [2025-04-29 11:11:30,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2025-04-29 11:11:30,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9190031152647975 [2025-04-29 11:11:30,822 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 259 flow. Second operand 3 states and 295 transitions. [2025-04-29 11:11:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 369 flow [2025-04-29 11:11:30,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 120 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:30,824 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 295 flow [2025-04-29 11:11:30,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2025-04-29 11:11:30,824 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2025-04-29 11:11:30,824 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 295 flow [2025-04-29 11:11:30,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:30,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:30,825 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] [2025-04-29 11:11:30,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:30,825 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:30,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:30,825 INFO L85 PathProgramCache]: Analyzing trace with hash -515866291, now seen corresponding path program 1 times [2025-04-29 11:11:30,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:30,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50532979] [2025-04-29 11:11:30,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:30,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:30,858 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:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:30,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50532979] [2025-04-29 11:11:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50532979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:30,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923959751] [2025-04-29 11:11:30,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:30,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:30,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:30,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:30,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2025-04-29 11:11:30,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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:30,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:30,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2025-04-29 11:11:30,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,103 INFO L116 PetriNetUnfolderBase]: 662/3137 cut-off events. [2025-04-29 11:11:31,103 INFO L117 PetriNetUnfolderBase]: For 430/450 co-relation queries the response was YES. [2025-04-29 11:11:31,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 3137 events. 662/3137 cut-off events. For 430/450 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 28316 event pairs, 320 based on Foata normal form. 63/2848 useless extension candidates. Maximal degree in co-relation 3788. Up to 540 conditions per place. [2025-04-29 11:11:31,114 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 31 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-04-29 11:11:31,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 406 flow [2025-04-29 11:11:31,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2025-04-29 11:11:31,116 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2025-04-29 11:11:31,116 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 295 flow. Second operand 4 states and 388 transitions. [2025-04-29 11:11:31,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 406 flow [2025-04-29 11:11:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:31,119 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 299 flow [2025-04-29 11:11:31,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2025-04-29 11:11:31,120 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 7 predicate places. [2025-04-29 11:11:31,120 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 299 flow [2025-04-29 11:11:31,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,120 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] [2025-04-29 11:11:31,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:31,120 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:31,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 756895587, now seen corresponding path program 1 times [2025-04-29 11:11:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104686443] [2025-04-29 11:11:31,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:31,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:31,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:31,189 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:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:31,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104686443] [2025-04-29 11:11:31,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104686443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:31,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:31,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:31,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503751122] [2025-04-29 11:11:31,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:31,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:31,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:31,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:31,231 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2025-04-29 11:11:31,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:31,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2025-04-29 11:11:31,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:31,586 INFO L116 PetriNetUnfolderBase]: 924/4792 cut-off events. [2025-04-29 11:11:31,586 INFO L117 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-04-29 11:11:31,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7023 conditions, 4792 events. 924/4792 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 48491 event pairs, 307 based on Foata normal form. 3/4235 useless extension candidates. Maximal degree in co-relation 3711. Up to 1086 conditions per place. [2025-04-29 11:11:31,608 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 35 selfloop transitions, 7 changer transitions 0/133 dead transitions. [2025-04-29 11:11:31,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 133 transitions, 425 flow [2025-04-29 11:11:31,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 645 transitions. [2025-04-29 11:11:31,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8611481975967957 [2025-04-29 11:11:31,610 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 299 flow. Second operand 7 states and 645 transitions. [2025-04-29 11:11:31,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 133 transitions, 425 flow [2025-04-29 11:11:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:31,616 INFO L231 Difference]: Finished difference. Result has 125 places, 116 transitions, 329 flow [2025-04-29 11:11:31,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=329, PETRI_PLACES=125, PETRI_TRANSITIONS=116} [2025-04-29 11:11:31,616 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 14 predicate places. [2025-04-29 11:11:31,616 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 116 transitions, 329 flow [2025-04-29 11:11:31,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:31,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:31,617 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:31,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:31,617 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:31,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash 771562338, now seen corresponding path program 1 times [2025-04-29 11:11:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:31,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761793838] [2025-04-29 11:11:31,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:31,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:31,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:31,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:31,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:31,642 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:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:31,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761793838] [2025-04-29 11:11:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761793838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:31,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128279095] [2025-04-29 11:11:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:31,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:31,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:31,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:31,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-04-29 11:11:31,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:31,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-04-29 11:11:31,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:32,002 INFO L116 PetriNetUnfolderBase]: 938/3980 cut-off events. [2025-04-29 11:11:32,002 INFO L117 PetriNetUnfolderBase]: For 1336/1547 co-relation queries the response was YES. [2025-04-29 11:11:32,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 3980 events. 938/3980 cut-off events. For 1336/1547 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39623 event pairs, 546 based on Foata normal form. 7/3592 useless extension candidates. Maximal degree in co-relation 6424. Up to 1216 conditions per place. [2025-04-29 11:11:32,020 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 28 selfloop transitions, 9 changer transitions 0/130 dead transitions. [2025-04-29 11:11:32,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 454 flow [2025-04-29 11:11:32,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-04-29 11:11:32,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9158878504672897 [2025-04-29 11:11:32,021 INFO L175 Difference]: Start difference. First operand has 125 places, 116 transitions, 329 flow. Second operand 3 states and 294 transitions. [2025-04-29 11:11:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 454 flow [2025-04-29 11:11:32,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 444 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:32,024 INFO L231 Difference]: Finished difference. Result has 126 places, 123 transitions, 395 flow [2025-04-29 11:11:32,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=126, PETRI_TRANSITIONS=123} [2025-04-29 11:11:32,025 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2025-04-29 11:11:32,025 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 123 transitions, 395 flow [2025-04-29 11:11:32,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,025 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] [2025-04-29 11:11:32,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:32,026 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:32,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1919478213, now seen corresponding path program 1 times [2025-04-29 11:11:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739314215] [2025-04-29 11:11:32,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:32,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:32,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:32,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,108 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:32,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739314215] [2025-04-29 11:11:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739314215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:32,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976686621] [2025-04-29 11:11:32,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:32,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:32,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:32,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2025-04-29 11:11:32,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 123 transitions, 395 flow. Second operand has 8 states, 8 states have (on average 87.625) internal successors, (701), 8 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:32,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2025-04-29 11:11:32,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:32,706 INFO L116 PetriNetUnfolderBase]: 1210/6107 cut-off events. [2025-04-29 11:11:32,706 INFO L117 PetriNetUnfolderBase]: For 1556/2456 co-relation queries the response was YES. [2025-04-29 11:11:32,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9765 conditions, 6107 events. 1210/6107 cut-off events. For 1556/2456 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 64885 event pairs, 186 based on Foata normal form. 16/5408 useless extension candidates. Maximal degree in co-relation 5335. Up to 927 conditions per place. [2025-04-29 11:11:32,743 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 47 selfloop transitions, 10 changer transitions 0/155 dead transitions. [2025-04-29 11:11:32,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 155 transitions, 577 flow [2025-04-29 11:11:32,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 918 transitions. [2025-04-29 11:11:32,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8579439252336448 [2025-04-29 11:11:32,746 INFO L175 Difference]: Start difference. First operand has 126 places, 123 transitions, 395 flow. Second operand 10 states and 918 transitions. [2025-04-29 11:11:32,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 155 transitions, 577 flow [2025-04-29 11:11:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 155 transitions, 559 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:32,752 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 417 flow [2025-04-29 11:11:32,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=417, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2025-04-29 11:11:32,753 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2025-04-29 11:11:32,753 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 417 flow [2025-04-29 11:11:32,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.625) internal successors, (701), 8 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:32,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,753 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:32,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:11:32,753 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:32,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -797883018, now seen corresponding path program 1 times [2025-04-29 11:11:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401210855] [2025-04-29 11:11:32,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:32,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:32,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:32,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,806 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:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401210855] [2025-04-29 11:11:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401210855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842534027] [2025-04-29 11:11:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:32,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:32,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 107 [2025-04-29 11:11:32,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 417 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 107 [2025-04-29 11:11:32,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:32,909 INFO L116 PetriNetUnfolderBase]: 91/1216 cut-off events. [2025-04-29 11:11:32,909 INFO L117 PetriNetUnfolderBase]: For 302/362 co-relation queries the response was YES. [2025-04-29 11:11:32,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1216 events. 91/1216 cut-off events. For 302/362 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8830 event pairs, 48 based on Foata normal form. 20/1131 useless extension candidates. Maximal degree in co-relation 1574. Up to 106 conditions per place. [2025-04-29 11:11:32,914 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2025-04-29 11:11:32,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 124 transitions, 448 flow [2025-04-29 11:11:32,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-04-29 11:11:32,915 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9439252336448598 [2025-04-29 11:11:32,915 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 417 flow. Second operand 3 states and 303 transitions. [2025-04-29 11:11:32,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 124 transitions, 448 flow [2025-04-29 11:11:32,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 124 transitions, 422 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:32,919 INFO L231 Difference]: Finished difference. Result has 132 places, 119 transitions, 367 flow [2025-04-29 11:11:32,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=132, PETRI_TRANSITIONS=119} [2025-04-29 11:11:32,919 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2025-04-29 11:11:32,919 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 119 transitions, 367 flow [2025-04-29 11:11:32,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:32,920 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:32,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:11:32,920 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:32,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -336454573, now seen corresponding path program 1 times [2025-04-29 11:11:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:32,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62420127] [2025-04-29 11:11:32,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:32,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:11:32,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:11:32,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:32,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:32,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62420127] [2025-04-29 11:11:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62420127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770329398] [2025-04-29 11:11:32,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:32,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:32,955 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2025-04-29 11:11:32,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 119 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:32,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2025-04-29 11:11:32,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:33,058 INFO L116 PetriNetUnfolderBase]: 177/1397 cut-off events. [2025-04-29 11:11:33,058 INFO L117 PetriNetUnfolderBase]: For 717/765 co-relation queries the response was YES. [2025-04-29 11:11:33,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 1397 events. 177/1397 cut-off events. For 717/765 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10761 event pairs, 135 based on Foata normal form. 3/1286 useless extension candidates. Maximal degree in co-relation 2120. Up to 336 conditions per place. [2025-04-29 11:11:33,063 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 23 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-04-29 11:11:33,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 441 flow [2025-04-29 11:11:33,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-04-29 11:11:33,064 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8940809968847352 [2025-04-29 11:11:33,064 INFO L175 Difference]: Start difference. First operand has 132 places, 119 transitions, 367 flow. Second operand 3 states and 287 transitions. [2025-04-29 11:11:33,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 441 flow [2025-04-29 11:11:33,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 124 transitions, 435 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:33,067 INFO L231 Difference]: Finished difference. Result has 135 places, 122 transitions, 395 flow [2025-04-29 11:11:33,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=135, PETRI_TRANSITIONS=122} [2025-04-29 11:11:33,067 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 24 predicate places. [2025-04-29 11:11:33,067 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 395 flow [2025-04-29 11:11:33,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:33,068 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:33,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1594293668, now seen corresponding path program 1 times [2025-04-29 11:11:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510322108] [2025-04-29 11:11:33,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:11:33,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:11:33,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:33,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510322108] [2025-04-29 11:11:33,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510322108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226530786] [2025-04-29 11:11:33,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:11:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:11:33,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:11:33,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2025-04-29 11:11:33,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 395 flow. Second operand has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 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,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2025-04-29 11:11:33,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:33,420 INFO L116 PetriNetUnfolderBase]: 151/827 cut-off events. [2025-04-29 11:11:33,421 INFO L117 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-04-29 11:11:33,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 827 events. 151/827 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4863 event pairs, 0 based on Foata normal form. 20/828 useless extension candidates. Maximal degree in co-relation 1492. Up to 88 conditions per place. [2025-04-29 11:11:33,424 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2025-04-29 11:11:33,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 490 flow [2025-04-29 11:11:33,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:11:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:11:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1167 transitions. [2025-04-29 11:11:33,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8389647735442128 [2025-04-29 11:11:33,426 INFO L175 Difference]: Start difference. First operand has 135 places, 122 transitions, 395 flow. Second operand 13 states and 1167 transitions. [2025-04-29 11:11:33,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 490 flow [2025-04-29 11:11:33,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 121 transitions, 452 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-29 11:11:33,428 INFO L231 Difference]: Finished difference. Result has 108 places, 82 transitions, 238 flow [2025-04-29 11:11:33,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=238, PETRI_PLACES=108, PETRI_TRANSITIONS=82} [2025-04-29 11:11:33,430 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2025-04-29 11:11:33,430 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 82 transitions, 238 flow [2025-04-29 11:11:33,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,430 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:33,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:33,430 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:33,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -301595151, now seen corresponding path program 1 times [2025-04-29 11:11:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774616405] [2025-04-29 11:11:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:33,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:33,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:33,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:33,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:33,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:33,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:33,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:33,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-29 11:11:33,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-29 11:11:33,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:11:33,466 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:33,467 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:33,467 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:11:33,480 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:11:33,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 125 transitions, 290 flow [2025-04-29 11:11:33,507 INFO L116 PetriNetUnfolderBase]: 21/540 cut-off events. [2025-04-29 11:11:33,507 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:11:33,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 540 events. 21/540 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2053 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 335. Up to 32 conditions per place. [2025-04-29 11:11:33,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 125 transitions, 290 flow [2025-04-29 11:11:33,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 125 transitions, 290 flow [2025-04-29 11:11:33,510 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:33,510 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;@221ac717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:33,510 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:11:33,511 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:33,511 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:33,511 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:33,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:33,511 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:33,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1254263028, now seen corresponding path program 1 times [2025-04-29 11:11:33,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815790991] [2025-04-29 11:11:33,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:33,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,532 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:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815790991] [2025-04-29 11:11:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815790991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779551815] [2025-04-29 11:11:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:33,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:33,553 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2025-04-29 11:11:33,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2025-04-29 11:11:33,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,093 INFO L116 PetriNetUnfolderBase]: 2015/8251 cut-off events. [2025-04-29 11:11:34,093 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-29 11:11:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11646 conditions, 8251 events. 2015/8251 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 84869 event pairs, 996 based on Foata normal form. 1/7503 useless extension candidates. Maximal degree in co-relation 3026. Up to 2117 conditions per place. [2025-04-29 11:11:34,139 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-04-29 11:11:34,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 380 flow [2025-04-29 11:11:34,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2025-04-29 11:11:34,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.886 [2025-04-29 11:11:34,140 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 290 flow. Second operand 4 states and 443 transitions. [2025-04-29 11:11:34,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 380 flow [2025-04-29 11:11:34,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:34,142 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 306 flow [2025-04-29 11:11:34,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-04-29 11:11:34,143 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places. [2025-04-29 11:11:34,143 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 306 flow [2025-04-29 11:11:34,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,144 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,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:11:34,144 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:34,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1957009347, now seen corresponding path program 1 times [2025-04-29 11:11:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840182701] [2025-04-29 11:11:34,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:34,150 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,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,244 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,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840182701] [2025-04-29 11:11:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840182701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692756492] [2025-04-29 11:11:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:34,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:34,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2025-04-29 11:11:34,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2025-04-29 11:11:34,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,505 INFO L116 PetriNetUnfolderBase]: 6248/15566 cut-off events. [2025-04-29 11:11:35,505 INFO L117 PetriNetUnfolderBase]: For 1593/1593 co-relation queries the response was YES. [2025-04-29 11:11:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25642 conditions, 15566 events. 6248/15566 cut-off events. For 1593/1593 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 158312 event pairs, 808 based on Foata normal form. 0/14520 useless extension candidates. Maximal degree in co-relation 23371. Up to 6781 conditions per place. [2025-04-29 11:11:35,590 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 62 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-04-29 11:11:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 502 flow [2025-04-29 11:11:35,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2025-04-29 11:11:35,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8093333333333333 [2025-04-29 11:11:35,591 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 306 flow. Second operand 6 states and 607 transitions. [2025-04-29 11:11:35,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 502 flow [2025-04-29 11:11:35,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:35,602 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 308 flow [2025-04-29 11:11:35,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2025-04-29 11:11:35,602 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 6 predicate places. [2025-04-29 11:11:35,602 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 308 flow [2025-04-29 11:11:35,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,603 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:35,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:11:35,603 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:35,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,603 INFO L85 PathProgramCache]: Analyzing trace with hash -860960879, now seen corresponding path program 1 times [2025-04-29 11:11:35,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709426160] [2025-04-29 11:11:35,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:35,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,617 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,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709426160] [2025-04-29 11:11:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709426160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292798145] [2025-04-29 11:11:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:35,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:35,633 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:35,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:35,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:37,291 INFO L116 PetriNetUnfolderBase]: 7178/23049 cut-off events. [2025-04-29 11:11:37,291 INFO L117 PetriNetUnfolderBase]: For 5373/6582 co-relation queries the response was YES. [2025-04-29 11:11:37,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35139 conditions, 23049 events. 7178/23049 cut-off events. For 5373/6582 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 278635 event pairs, 4486 based on Foata normal form. 5/20318 useless extension candidates. Maximal degree in co-relation 12843. Up to 8464 conditions per place. [2025-04-29 11:11:37,409 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 36 selfloop transitions, 7 changer transitions 0/143 dead transitions. [2025-04-29 11:11:37,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 143 transitions, 460 flow [2025-04-29 11:11:37,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-04-29 11:11:37,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9173333333333333 [2025-04-29 11:11:37,410 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 308 flow. Second operand 3 states and 344 transitions. [2025-04-29 11:11:37,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 143 transitions, 460 flow [2025-04-29 11:11:37,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 143 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:37,413 INFO L231 Difference]: Finished difference. Result has 135 places, 131 transitions, 352 flow [2025-04-29 11:11:37,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=135, PETRI_TRANSITIONS=131} [2025-04-29 11:11:37,414 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 5 predicate places. [2025-04-29 11:11:37,414 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 131 transitions, 352 flow [2025-04-29 11:11:37,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:37,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:37,414 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] [2025-04-29 11:11:37,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:11:37,414 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:37,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:37,415 INFO L85 PathProgramCache]: Analyzing trace with hash 237274650, now seen corresponding path program 1 times [2025-04-29 11:11:37,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:37,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615505744] [2025-04-29 11:11:37,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:37,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:37,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:37,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:37,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,441 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:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:37,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615505744] [2025-04-29 11:11:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615505744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:37,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495617652] [2025-04-29 11:11:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:37,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:37,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:37,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:37,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2025-04-29 11:11:37,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 131 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:37,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2025-04-29 11:11:37,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:39,407 INFO L116 PetriNetUnfolderBase]: 5432/18969 cut-off events. [2025-04-29 11:11:39,408 INFO L117 PetriNetUnfolderBase]: For 2758/2856 co-relation queries the response was YES. [2025-04-29 11:11:39,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29354 conditions, 18969 events. 5432/18969 cut-off events. For 2758/2856 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 227790 event pairs, 2948 based on Foata normal form. 259/16850 useless extension candidates. Maximal degree in co-relation 23832. Up to 3845 conditions per place. [2025-04-29 11:11:39,493 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 40 selfloop transitions, 4 changer transitions 0/152 dead transitions. [2025-04-29 11:11:39,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 494 flow [2025-04-29 11:11:39,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2025-04-29 11:11:39,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.906 [2025-04-29 11:11:39,494 INFO L175 Difference]: Start difference. First operand has 135 places, 131 transitions, 352 flow. Second operand 4 states and 453 transitions. [2025-04-29 11:11:39,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 494 flow [2025-04-29 11:11:39,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:39,504 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 354 flow [2025-04-29 11:11:39,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-04-29 11:11:39,504 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 7 predicate places. [2025-04-29 11:11:39,504 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 354 flow [2025-04-29 11:11:39,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:39,505 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] [2025-04-29 11:11:39,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:11:39,505 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:39,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash 669638739, now seen corresponding path program 1 times [2025-04-29 11:11:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:39,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431774095] [2025-04-29 11:11:39,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:39,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:39,552 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:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:39,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431774095] [2025-04-29 11:11:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431774095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:39,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056336485] [2025-04-29 11:11:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:39,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:39,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:39,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:39,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:39,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:39,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:39,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:41,427 INFO L116 PetriNetUnfolderBase]: 6364/23536 cut-off events. [2025-04-29 11:11:41,427 INFO L117 PetriNetUnfolderBase]: For 3161/3161 co-relation queries the response was YES. [2025-04-29 11:11:41,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35944 conditions, 23536 events. 6364/23536 cut-off events. For 3161/3161 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 298488 event pairs, 2751 based on Foata normal form. 3/20175 useless extension candidates. Maximal degree in co-relation 20506. Up to 5703 conditions per place. [2025-04-29 11:11:41,547 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 41 selfloop transitions, 7 changer transitions 0/154 dead transitions. [2025-04-29 11:11:41,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 154 transitions, 496 flow [2025-04-29 11:11:41,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2025-04-29 11:11:41,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.856 [2025-04-29 11:11:41,549 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 354 flow. Second operand 7 states and 749 transitions. [2025-04-29 11:11:41,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 154 transitions, 496 flow [2025-04-29 11:11:41,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 154 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:41,556 INFO L231 Difference]: Finished difference. Result has 144 places, 135 transitions, 384 flow [2025-04-29 11:11:41,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=384, PETRI_PLACES=144, PETRI_TRANSITIONS=135} [2025-04-29 11:11:41,556 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 14 predicate places. [2025-04-29 11:11:41,556 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 135 transitions, 384 flow [2025-04-29 11:11:41,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:41,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:41,557 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:41,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:11:41,557 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:41,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash -581531534, now seen corresponding path program 1 times [2025-04-29 11:11:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:41,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646156714] [2025-04-29 11:11:41,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:41,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:41,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:41,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:41,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:41,575 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:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:41,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646156714] [2025-04-29 11:11:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646156714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:41,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:41,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175243529] [2025-04-29 11:11:41,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:41,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:41,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:41,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:41,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:41,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 135 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:41,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:41,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:41,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:44,426 INFO L116 PetriNetUnfolderBase]: 8620/30227 cut-off events. [2025-04-29 11:11:44,426 INFO L117 PetriNetUnfolderBase]: For 11721/13736 co-relation queries the response was YES. [2025-04-29 11:11:44,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51443 conditions, 30227 events. 8620/30227 cut-off events. For 11721/13736 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 394834 event pairs, 4986 based on Foata normal form. 38/26916 useless extension candidates. Maximal degree in co-relation 50164. Up to 9839 conditions per place. [2025-04-29 11:11:44,734 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 38 selfloop transitions, 11 changer transitions 0/155 dead transitions. [2025-04-29 11:11:44,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 155 transitions, 561 flow [2025-04-29 11:11:44,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-04-29 11:11:44,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-04-29 11:11:44,735 INFO L175 Difference]: Start difference. First operand has 144 places, 135 transitions, 384 flow. Second operand 3 states and 343 transitions. [2025-04-29 11:11:44,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 155 transitions, 561 flow [2025-04-29 11:11:44,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 155 transitions, 551 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:44,757 INFO L231 Difference]: Finished difference. Result has 145 places, 144 transitions, 470 flow [2025-04-29 11:11:44,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=145, PETRI_TRANSITIONS=144} [2025-04-29 11:11:44,758 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2025-04-29 11:11:44,758 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 144 transitions, 470 flow [2025-04-29 11:11:44,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:44,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:44,758 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] [2025-04-29 11:11:44,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:11:44,758 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:44,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -21317022, now seen corresponding path program 1 times [2025-04-29 11:11:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:44,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634952955] [2025-04-29 11:11:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:44,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:44,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:44,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:44,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:44,843 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:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:44,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634952955] [2025-04-29 11:11:44,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634952955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:44,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:44,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366616658] [2025-04-29 11:11:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:44,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:44,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:44,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:44,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:44,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 144 transitions, 470 flow. Second operand has 8 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 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:44,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:44,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:44,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:48,374 INFO L116 PetriNetUnfolderBase]: 9234/35939 cut-off events. [2025-04-29 11:11:48,375 INFO L117 PetriNetUnfolderBase]: For 10340/19344 co-relation queries the response was YES. [2025-04-29 11:11:48,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59405 conditions, 35939 events. 9234/35939 cut-off events. For 10340/19344 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 495551 event pairs, 2450 based on Foata normal form. 33/30919 useless extension candidates. Maximal degree in co-relation 28376. Up to 8114 conditions per place. [2025-04-29 11:11:48,684 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 55 selfloop transitions, 10 changer transitions 0/180 dead transitions. [2025-04-29 11:11:48,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 180 transitions, 682 flow [2025-04-29 11:11:48,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1066 transitions. [2025-04-29 11:11:48,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8528 [2025-04-29 11:11:48,685 INFO L175 Difference]: Start difference. First operand has 145 places, 144 transitions, 470 flow. Second operand 10 states and 1066 transitions. [2025-04-29 11:11:48,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 180 transitions, 682 flow [2025-04-29 11:11:48,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 180 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:48,721 INFO L231 Difference]: Finished difference. Result has 155 places, 147 transitions, 496 flow [2025-04-29 11:11:48,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=496, PETRI_PLACES=155, PETRI_TRANSITIONS=147} [2025-04-29 11:11:48,723 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-04-29 11:11:48,724 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 496 flow [2025-04-29 11:11:48,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.625) internal successors, (813), 8 states have internal predecessors, (813), 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:48,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:48,724 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:48,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:11:48,724 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:48,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -174551228, now seen corresponding path program 1 times [2025-04-29 11:11:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:48,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515464520] [2025-04-29 11:11:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:48,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:48,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:48,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:48,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:48,779 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:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:48,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515464520] [2025-04-29 11:11:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515464520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:48,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399818651] [2025-04-29 11:11:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:48,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:48,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:48,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:48,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 125 [2025-04-29 11:11:48,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:48,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:48,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 125 [2025-04-29 11:11:48,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,269 INFO L116 PetriNetUnfolderBase]: 530/4985 cut-off events. [2025-04-29 11:11:49,269 INFO L117 PetriNetUnfolderBase]: For 1404/1593 co-relation queries the response was YES. [2025-04-29 11:11:49,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7524 conditions, 4985 events. 530/4985 cut-off events. For 1404/1593 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 54095 event pairs, 194 based on Foata normal form. 140/4647 useless extension candidates. Maximal degree in co-relation 3537. Up to 422 conditions per place. [2025-04-29 11:11:49,296 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 16 selfloop transitions, 8 changer transitions 0/145 dead transitions. [2025-04-29 11:11:49,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 145 transitions, 537 flow [2025-04-29 11:11:49,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2025-04-29 11:11:49,297 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9386666666666666 [2025-04-29 11:11:49,297 INFO L175 Difference]: Start difference. First operand has 155 places, 147 transitions, 496 flow. Second operand 3 states and 352 transitions. [2025-04-29 11:11:49,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 145 transitions, 537 flow [2025-04-29 11:11:49,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 511 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:49,303 INFO L231 Difference]: Finished difference. Result has 151 places, 138 transitions, 432 flow [2025-04-29 11:11:49,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2025-04-29 11:11:49,304 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 21 predicate places. [2025-04-29 11:11:49,304 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 432 flow [2025-04-29 11:11:49,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:49,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,304 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:49,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:11:49,304 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:49,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2077827904, now seen corresponding path program 1 times [2025-04-29 11:11:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780392539] [2025-04-29 11:11:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:11:49,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:11:49,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:49,332 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:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:49,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780392539] [2025-04-29 11:11:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780392539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:49,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:49,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532771564] [2025-04-29 11:11:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:49,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:49,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:49,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:49,351 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:49,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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:49,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:49,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:49,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:49,929 INFO L116 PetriNetUnfolderBase]: 928/5554 cut-off events. [2025-04-29 11:11:49,930 INFO L117 PetriNetUnfolderBase]: For 3655/3799 co-relation queries the response was YES. [2025-04-29 11:11:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10012 conditions, 5554 events. 928/5554 cut-off events. For 3655/3799 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 61179 event pairs, 707 based on Foata normal form. 7/5049 useless extension candidates. Maximal degree in co-relation 7285. Up to 1545 conditions per place. [2025-04-29 11:11:49,953 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/145 dead transitions. [2025-04-29 11:11:49,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 145 transitions, 536 flow [2025-04-29 11:11:49,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-04-29 11:11:49,954 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.888 [2025-04-29 11:11:49,954 INFO L175 Difference]: Start difference. First operand has 151 places, 138 transitions, 432 flow. Second operand 3 states and 333 transitions. [2025-04-29 11:11:49,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 145 transitions, 536 flow [2025-04-29 11:11:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 145 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:49,957 INFO L231 Difference]: Finished difference. Result has 154 places, 141 transitions, 458 flow [2025-04-29 11:11:49,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=154, PETRI_TRANSITIONS=141} [2025-04-29 11:11:49,957 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 24 predicate places. [2025-04-29 11:11:49,957 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 458 flow [2025-04-29 11:11:49,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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:49,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:49,957 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:49,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:11:49,957 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:49,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1313915340, now seen corresponding path program 1 times [2025-04-29 11:11:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:49,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193024434] [2025-04-29 11:11:49,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:49,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:11:49,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:11:49,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:49,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:50,076 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:50,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:50,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193024434] [2025-04-29 11:11:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193024434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:50,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:50,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:50,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177165454] [2025-04-29 11:11:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:50,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:11:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:50,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:11:50,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:11:50,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2025-04-29 11:11:50,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 458 flow. Second operand has 10 states, 10 states have (on average 101.0) internal successors, (1010), 10 states have internal predecessors, (1010), 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:50,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:50,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2025-04-29 11:11:50,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,946 INFO L116 PetriNetUnfolderBase]: 1216/8141 cut-off events. [2025-04-29 11:11:50,946 INFO L117 PetriNetUnfolderBase]: For 3522/3788 co-relation queries the response was YES. [2025-04-29 11:11:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13554 conditions, 8141 events. 1216/8141 cut-off events. For 3522/3788 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 88481 event pairs, 223 based on Foata normal form. 20/7404 useless extension candidates. Maximal degree in co-relation 5490. Up to 893 conditions per place. [2025-04-29 11:11:50,978 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 76 selfloop transitions, 14 changer transitions 1/199 dead transitions. [2025-04-29 11:11:50,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 199 transitions, 816 flow [2025-04-29 11:11:50,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:11:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:11:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1379 transitions. [2025-04-29 11:11:50,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8486153846153847 [2025-04-29 11:11:50,979 INFO L175 Difference]: Start difference. First operand has 154 places, 141 transitions, 458 flow. Second operand 13 states and 1379 transitions. [2025-04-29 11:11:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 199 transitions, 816 flow [2025-04-29 11:11:50,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 199 transitions, 804 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:50,986 INFO L231 Difference]: Finished difference. Result has 168 places, 144 transitions, 508 flow [2025-04-29 11:11:50,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=508, PETRI_PLACES=168, PETRI_TRANSITIONS=144} [2025-04-29 11:11:50,986 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 38 predicate places. [2025-04-29 11:11:50,987 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 144 transitions, 508 flow [2025-04-29 11:11:50,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.0) internal successors, (1010), 10 states have internal predecessors, (1010), 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:50,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:50,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:11:50,987 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:50,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1135371423, now seen corresponding path program 1 times [2025-04-29 11:11:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716245406] [2025-04-29 11:11:50,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:11:50,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:11:50,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:50,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,012 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:51,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716245406] [2025-04-29 11:11:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716245406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452533788] [2025-04-29 11:11:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:51,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:51,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 125 [2025-04-29 11:11:51,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 144 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:51,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 125 [2025-04-29 11:11:51,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:51,501 INFO L116 PetriNetUnfolderBase]: 883/5626 cut-off events. [2025-04-29 11:11:51,502 INFO L117 PetriNetUnfolderBase]: For 4141/4237 co-relation queries the response was YES. [2025-04-29 11:11:51,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10504 conditions, 5626 events. 883/5626 cut-off events. For 4141/4237 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 61511 event pairs, 677 based on Foata normal form. 4/5128 useless extension candidates. Maximal degree in co-relation 9689. Up to 1476 conditions per place. [2025-04-29 11:11:51,531 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 30 selfloop transitions, 4 changer transitions 0/150 dead transitions. [2025-04-29 11:11:51,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 150 transitions, 603 flow [2025-04-29 11:11:51,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-04-29 11:11:51,532 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8853333333333333 [2025-04-29 11:11:51,532 INFO L175 Difference]: Start difference. First operand has 168 places, 144 transitions, 508 flow. Second operand 3 states and 332 transitions. [2025-04-29 11:11:51,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 150 transitions, 603 flow [2025-04-29 11:11:51,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 150 transitions, 573 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:51,540 INFO L231 Difference]: Finished difference. Result has 164 places, 147 transitions, 514 flow [2025-04-29 11:11:51,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=164, PETRI_TRANSITIONS=147} [2025-04-29 11:11:51,540 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 34 predicate places. [2025-04-29 11:11:51,540 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 147 transitions, 514 flow [2025-04-29 11:11:51,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:51,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:51,540 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 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:51,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:11:51,541 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:51,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -62490973, now seen corresponding path program 1 times [2025-04-29 11:11:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:51,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056984638] [2025-04-29 11:11:51,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:51,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-29 11:11:51,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-29 11:11:51,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,727 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:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056984638] [2025-04-29 11:11:51,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056984638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329824366] [2025-04-29 11:11:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:51,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:51,788 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 125 [2025-04-29 11:11:51,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 147 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:51,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 125 [2025-04-29 11:11:51,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:52,706 INFO L116 PetriNetUnfolderBase]: 2726/11124 cut-off events. [2025-04-29 11:11:52,706 INFO L117 PetriNetUnfolderBase]: For 4566/4870 co-relation queries the response was YES. [2025-04-29 11:11:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21462 conditions, 11124 events. 2726/11124 cut-off events. For 4566/4870 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 122064 event pairs, 1342 based on Foata normal form. 0/10420 useless extension candidates. Maximal degree in co-relation 19173. Up to 2509 conditions per place. [2025-04-29 11:11:52,760 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 59 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-04-29 11:11:52,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 738 flow [2025-04-29 11:11:52,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2025-04-29 11:11:52,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8226666666666667 [2025-04-29 11:11:52,761 INFO L175 Difference]: Start difference. First operand has 164 places, 147 transitions, 514 flow. Second operand 6 states and 617 transitions. [2025-04-29 11:11:52,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 738 flow [2025-04-29 11:11:52,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 178 transitions, 724 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:52,780 INFO L231 Difference]: Finished difference. Result has 166 places, 146 transitions, 510 flow [2025-04-29 11:11:52,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=166, PETRI_TRANSITIONS=146} [2025-04-29 11:11:52,781 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 36 predicate places. [2025-04-29 11:11:52,781 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 146 transitions, 510 flow [2025-04-29 11:11:52,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 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:52,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:52,781 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:52,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-29 11:11:52,781 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:52,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash -122311329, now seen corresponding path program 1 times [2025-04-29 11:11:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:52,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744215820] [2025-04-29 11:11:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:52,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-29 11:11:52,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:11:52,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:52,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:52,923 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:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:52,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744215820] [2025-04-29 11:11:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744215820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:11:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352109336] [2025-04-29 11:11:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:52,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:11:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:52,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:11:52,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:11:53,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2025-04-29 11:11:53,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 146 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:53,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:53,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2025-04-29 11:11:53,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:53,829 INFO L116 PetriNetUnfolderBase]: 1190/7523 cut-off events. [2025-04-29 11:11:53,830 INFO L117 PetriNetUnfolderBase]: For 4221/4449 co-relation queries the response was YES. [2025-04-29 11:11:53,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14305 conditions, 7523 events. 1190/7523 cut-off events. For 4221/4449 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 80805 event pairs, 159 based on Foata normal form. 48/7003 useless extension candidates. Maximal degree in co-relation 4935. Up to 557 conditions per place. [2025-04-29 11:11:53,867 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 90 selfloop transitions, 16 changer transitions 8/223 dead transitions. [2025-04-29 11:11:53,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 223 transitions, 966 flow [2025-04-29 11:11:53,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:11:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:11:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1699 transitions. [2025-04-29 11:11:53,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8495 [2025-04-29 11:11:53,869 INFO L175 Difference]: Start difference. First operand has 166 places, 146 transitions, 510 flow. Second operand 16 states and 1699 transitions. [2025-04-29 11:11:53,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 223 transitions, 966 flow [2025-04-29 11:11:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 223 transitions, 946 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:53,879 INFO L231 Difference]: Finished difference. Result has 172 places, 144 transitions, 510 flow [2025-04-29 11:11:53,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=510, PETRI_PLACES=172, PETRI_TRANSITIONS=144} [2025-04-29 11:11:53,879 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 42 predicate places. [2025-04-29 11:11:53,880 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 144 transitions, 510 flow [2025-04-29 11:11:53,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:53,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:53,880 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-29 11:11:53,880 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:53,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash -162192484, now seen corresponding path program 1 times [2025-04-29 11:11:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:53,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976987348] [2025-04-29 11:11:53,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:53,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-29 11:11:53,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-29 11:11:53,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:53,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:53,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:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:53,920 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976987348] [2025-04-29 11:11:53,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976987348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:53,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:53,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:53,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321253451] [2025-04-29 11:11:53,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:53,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:53,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:53,933 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2025-04-29 11:11:53,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 144 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:53,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2025-04-29 11:11:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:54,742 INFO L116 PetriNetUnfolderBase]: 1353/8850 cut-off events. [2025-04-29 11:11:54,742 INFO L117 PetriNetUnfolderBase]: For 5222/5306 co-relation queries the response was YES. [2025-04-29 11:11:54,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16716 conditions, 8850 events. 1353/8850 cut-off events. For 5222/5306 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 105837 event pairs, 605 based on Foata normal form. 0/8290 useless extension candidates. Maximal degree in co-relation 15933. Up to 1591 conditions per place. [2025-04-29 11:11:54,784 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 30 selfloop transitions, 9 changer transitions 1/157 dead transitions. [2025-04-29 11:11:54,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 157 transitions, 644 flow [2025-04-29 11:11:54,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-04-29 11:11:54,785 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9146666666666666 [2025-04-29 11:11:54,785 INFO L175 Difference]: Start difference. First operand has 172 places, 144 transitions, 510 flow. Second operand 3 states and 343 transitions. [2025-04-29 11:11:54,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 157 transitions, 644 flow [2025-04-29 11:11:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 157 transitions, 576 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-29 11:11:54,820 INFO L231 Difference]: Finished difference. Result has 155 places, 148 transitions, 518 flow [2025-04-29 11:11:54,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=155, PETRI_TRANSITIONS=148} [2025-04-29 11:11:54,821 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 25 predicate places. [2025-04-29 11:11:54,821 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 148 transitions, 518 flow [2025-04-29 11:11:54,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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:54,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:54,821 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-29 11:11:54,821 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:54,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1234344470, now seen corresponding path program 1 times [2025-04-29 11:11:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:54,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426832470] [2025-04-29 11:11:54,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:54,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:11:54,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:11:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:54,900 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:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:54,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426832470] [2025-04-29 11:11:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426832470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059145114] [2025-04-29 11:11:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:54,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:11:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:54,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:11:54,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:11:54,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2025-04-29 11:11:54,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 148 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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:54,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:54,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2025-04-29 11:11:54,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,383 INFO L116 PetriNetUnfolderBase]: 806/5285 cut-off events. [2025-04-29 11:11:55,383 INFO L117 PetriNetUnfolderBase]: For 3299/3495 co-relation queries the response was YES. [2025-04-29 11:11:55,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9671 conditions, 5285 events. 806/5285 cut-off events. For 3299/3495 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 53581 event pairs, 246 based on Foata normal form. 80/5245 useless extension candidates. Maximal degree in co-relation 9011. Up to 610 conditions per place. [2025-04-29 11:11:55,408 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 44 selfloop transitions, 5 changer transitions 8/181 dead transitions. [2025-04-29 11:11:55,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 181 transitions, 744 flow [2025-04-29 11:11:55,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:11:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:11:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2025-04-29 11:11:55,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9088 [2025-04-29 11:11:55,411 INFO L175 Difference]: Start difference. First operand has 155 places, 148 transitions, 518 flow. Second operand 5 states and 568 transitions. [2025-04-29 11:11:55,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 181 transitions, 744 flow [2025-04-29 11:11:55,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 181 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:55,420 INFO L231 Difference]: Finished difference. Result has 158 places, 149 transitions, 520 flow [2025-04-29 11:11:55,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=158, PETRI_TRANSITIONS=149} [2025-04-29 11:11:55,421 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 28 predicate places. [2025-04-29 11:11:55,421 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 149 transitions, 520 flow [2025-04-29 11:11:55,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,422 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:55,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-29 11:11:55,423 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:55,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash -749337083, now seen corresponding path program 1 times [2025-04-29 11:11:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543836439] [2025-04-29 11:11:55,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-29 11:11:55,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:11:55,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:55,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543836439] [2025-04-29 11:11:55,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543836439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:55,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781900200] [2025-04-29 11:11:55,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:55,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:55,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:55,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:11:56,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-29 11:11:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:11:56,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:56,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:11:56,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:56,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:11:56,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:56,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-29 11:11:56,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-29 11:11:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:56,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:57,298 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-04-29 11:11:57,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-04-29 11:11:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781900200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:57,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 41 [2025-04-29 11:11:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712643200] [2025-04-29 11:11:57,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:57,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-29 11:11:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:57,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-29 11:11:57,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1482, Unknown=0, NotChecked=0, Total=1640 [2025-04-29 11:11:58,887 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:00,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:01,563 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:02,814 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:04,023 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:05,263 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:12,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:12:12,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 125 [2025-04-29 11:12:12,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 149 transitions, 520 flow. Second operand has 41 states, 41 states have (on average 84.97560975609755) internal successors, (3484), 41 states have internal predecessors, (3484), 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:12,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:12,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 125 [2025-04-29 11:12:12,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:14,091 INFO L116 PetriNetUnfolderBase]: 2282/7801 cut-off events. [2025-04-29 11:12:14,091 INFO L117 PetriNetUnfolderBase]: For 3990/4186 co-relation queries the response was YES. [2025-04-29 11:12:14,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16494 conditions, 7801 events. 2282/7801 cut-off events. For 3990/4186 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 75159 event pairs, 156 based on Foata normal form. 24/7536 useless extension candidates. Maximal degree in co-relation 6963. Up to 1168 conditions per place. [2025-04-29 11:12:14,125 INFO L140 encePairwiseOnDemand]: 108/125 looper letters, 154 selfloop transitions, 27 changer transitions 8/285 dead transitions. [2025-04-29 11:12:14,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 285 transitions, 1295 flow [2025-04-29 11:12:14,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:12:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-29 11:12:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2133 transitions. [2025-04-29 11:12:14,127 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.711 [2025-04-29 11:12:14,127 INFO L175 Difference]: Start difference. First operand has 158 places, 149 transitions, 520 flow. Second operand 24 states and 2133 transitions. [2025-04-29 11:12:14,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 285 transitions, 1295 flow [2025-04-29 11:12:14,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 285 transitions, 1285 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:14,134 INFO L231 Difference]: Finished difference. Result has 186 places, 157 transitions, 616 flow [2025-04-29 11:12:14,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=616, PETRI_PLACES=186, PETRI_TRANSITIONS=157} [2025-04-29 11:12:14,135 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 56 predicate places. [2025-04-29 11:12:14,136 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 157 transitions, 616 flow [2025-04-29 11:12:14,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 84.97560975609755) internal successors, (3484), 41 states have internal predecessors, (3484), 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:14,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:14,137 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:14,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:12:14,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:12:14,342 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:14,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:14,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1693933515, now seen corresponding path program 2 times [2025-04-29 11:12:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:14,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873058127] [2025-04-29 11:12:14,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:12:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:14,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-04-29 11:12:14,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:12:14,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:12:14,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:12:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:15,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873058127] [2025-04-29 11:12:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873058127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:12:15,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336148862] [2025-04-29 11:12:15,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:12:15,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:12:15,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:15,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:12:15,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:12:15,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-04-29 11:12:15,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:12:15,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:12:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:15,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:12:15,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:12:16,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:12:16,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:12:16,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-29 11:12:17,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:12:17,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-04-29 11:12:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:12:17,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15