./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-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/per-thread-array-index-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 2108aa353e4730c3ede1a3c5a9c206cd8b23aeadffdfbe3e8dc8a7a2b2203fe1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:37,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:37,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:37,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:37,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:37,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:37,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:37,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:37,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:37,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:37,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:37,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:37,536 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:37,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:37,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:37,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:37,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:37,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:37,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:37,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:37,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:37,540 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 -> 2108aa353e4730c3ede1a3c5a9c206cd8b23aeadffdfbe3e8dc8a7a2b2203fe1 [2025-04-29 11:10:37,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:37,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:37,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:37,800 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:37,801 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:37,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race-2.c [2025-04-29 11:10:39,097 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913b3be88/06f5d1f45e3d4b9a97e96a30bac2dbaa/FLAG7de5ac6aa [2025-04-29 11:10:39,339 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:39,340 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index-race-2.c [2025-04-29 11:10:39,342 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:39,342 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:39,347 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913b3be88/06f5d1f45e3d4b9a97e96a30bac2dbaa/FLAG7de5ac6aa [2025-04-29 11:10:40,148 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913b3be88/06f5d1f45e3d4b9a97e96a30bac2dbaa [2025-04-29 11:10:40,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:40,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:40,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:40,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:40,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:40,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d257a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40, skipping insertion in model container [2025-04-29 11:10:40,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:40,313 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:40,322 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:40,352 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:40,367 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:40,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40 WrapperNode [2025-04-29 11:10:40,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:40,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:40,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:40,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:40,373 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:10:40" (1/1) ... [2025-04-29 11:10:40,382 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:10:40" (1/1) ... [2025-04-29 11:10:40,400 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-04-29 11:10:40,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:40,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:40,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:40,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:40,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:40,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:40,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:40,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:40,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (1/1) ... [2025-04-29 11:10:40,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:40,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:40,471 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:10:40,476 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:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:40,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:40,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:40,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:40,496 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:10:40,557 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:40,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:40,709 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:40,709 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:40,719 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:40,721 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:40,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:40 BoogieIcfgContainer [2025-04-29 11:10:40,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:40,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:40,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:40,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:40,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:40" (1/3) ... [2025-04-29 11:10:40,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a191490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:40, skipping insertion in model container [2025-04-29 11:10:40,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:40" (2/3) ... [2025-04-29 11:10:40,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a191490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:40, skipping insertion in model container [2025-04-29 11:10:40,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:40" (3/3) ... [2025-04-29 11:10:40,729 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.c [2025-04-29 11:10:40,740 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:40,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race-2.c that has 2 procedures, 92 locations, 93 edges, 1 initial locations, 2 loop locations, and 6 error locations. [2025-04-29 11:10:40,743 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:40,804 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:40,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 195 flow [2025-04-29 11:10:40,879 INFO L116 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-04-29 11:10:40,881 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:40,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 220 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-04-29 11:10:40,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 94 transitions, 195 flow [2025-04-29 11:10:40,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 94 transitions, 195 flow [2025-04-29 11:10:40,891 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:40,899 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;@1ca73573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:40,899 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:10:40,905 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:40,905 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:40,905 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:40,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:40,907 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] [2025-04-29 11:10:40,907 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:40,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1789159661, now seen corresponding path program 1 times [2025-04-29 11:10:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:40,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93070177] [2025-04-29 11:10:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:40,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:40,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:40,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:40,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:41,079 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:10:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:41,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93070177] [2025-04-29 11:10:41,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93070177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:41,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:41,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861541514] [2025-04-29 11:10:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:41,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:41,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:41,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:41,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2025-04-29 11:10:41,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:10:41,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:41,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2025-04-29 11:10:41,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:41,192 INFO L116 PetriNetUnfolderBase]: 3/161 cut-off events. [2025-04-29 11:10:41,192 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:41,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 332 event pairs, 2 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2025-04-29 11:10:41,197 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-04-29 11:10:41,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2025-04-29 11:10:41,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-04-29 11:10:41,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-04-29 11:10:41,212 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 195 flow. Second operand 3 states and 258 transitions. [2025-04-29 11:10:41,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2025-04-29 11:10:41,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:41,223 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2025-04-29 11:10:41,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-04-29 11:10:41,229 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-04-29 11:10:41,230 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2025-04-29 11:10:41,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:10:41,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:41,231 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] [2025-04-29 11:10:41,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:41,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:41,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash -501236625, now seen corresponding path program 1 times [2025-04-29 11:10:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:41,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104744468] [2025-04-29 11:10:41,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:41,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:41,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:41,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:41,311 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:10:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:41,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104744468] [2025-04-29 11:10:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104744468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533642407] [2025-04-29 11:10:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:41,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:41,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2025-04-29 11:10:41,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:10:41,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:41,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2025-04-29 11:10:41,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:41,362 INFO L116 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-04-29 11:10:41,362 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:10:41,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 337 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2025-04-29 11:10:41,363 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-04-29 11:10:41,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2025-04-29 11:10:41,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-29 11:10:41,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2025-04-29 11:10:41,365 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2025-04-29 11:10:41,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2025-04-29 11:10:41,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:41,367 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2025-04-29 11:10:41,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-04-29 11:10:41,367 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-04-29 11:10:41,367 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2025-04-29 11:10:41,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:10:41,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:41,368 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] [2025-04-29 11:10:41,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:41,368 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:41,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1024549463, now seen corresponding path program 1 times [2025-04-29 11:10:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:41,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684593849] [2025-04-29 11:10:41,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:41,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:41,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:41,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:41,483 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:10:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:41,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684593849] [2025-04-29 11:10:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684593849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752431936] [2025-04-29 11:10:41,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:41,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:41,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:41,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:41,560 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-04-29 11:10:41,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:41,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:41,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-04-29 11:10:41,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:41,610 INFO L116 PetriNetUnfolderBase]: 2/147 cut-off events. [2025-04-29 11:10:41,610 INFO L117 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-04-29 11:10:41,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 147 events. 2/147 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 241 event pairs, 0 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 86. Up to 16 conditions per place. [2025-04-29 11:10:41,611 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/96 dead transitions. [2025-04-29 11:10:41,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 245 flow [2025-04-29 11:10:41,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2025-04-29 11:10:41,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8847517730496454 [2025-04-29 11:10:41,614 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 499 transitions. [2025-04-29 11:10:41,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 245 flow [2025-04-29 11:10:41,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:41,616 INFO L231 Difference]: Finished difference. Result has 103 places, 91 transitions, 217 flow [2025-04-29 11:10:41,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=103, PETRI_TRANSITIONS=91} [2025-04-29 11:10:41,618 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 8 predicate places. [2025-04-29 11:10:41,618 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 91 transitions, 217 flow [2025-04-29 11:10:41,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:41,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:41,619 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] [2025-04-29 11:10:41,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:41,619 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:41,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -898378172, now seen corresponding path program 1 times [2025-04-29 11:10:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:41,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977697177] [2025-04-29 11:10:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:41,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:41,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:41,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:41,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,041 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:10:42,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977697177] [2025-04-29 11:10:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977697177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:42,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994622526] [2025-04-29 11:10:42,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:42,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:42,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2025-04-29 11:10:42,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 91 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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:10:42,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2025-04-29 11:10:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,257 INFO L116 PetriNetUnfolderBase]: 71/370 cut-off events. [2025-04-29 11:10:42,258 INFO L117 PetriNetUnfolderBase]: For 23/26 co-relation queries the response was YES. [2025-04-29 11:10:42,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 370 events. 71/370 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1762 event pairs, 32 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 531. Up to 151 conditions per place. [2025-04-29 11:10:42,259 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2025-04-29 11:10:42,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 349 flow [2025-04-29 11:10:42,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2025-04-29 11:10:42,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8156028368794326 [2025-04-29 11:10:42,261 INFO L175 Difference]: Start difference. First operand has 103 places, 91 transitions, 217 flow. Second operand 6 states and 460 transitions. [2025-04-29 11:10:42,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 349 flow [2025-04-29 11:10:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 112 transitions, 335 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:42,273 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 353 flow [2025-04-29 11:10:42,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2025-04-29 11:10:42,275 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2025-04-29 11:10:42,275 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 353 flow [2025-04-29 11:10:42,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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:10:42,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:42,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:42,276 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:42,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -778953129, now seen corresponding path program 1 times [2025-04-29 11:10:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947203334] [2025-04-29 11:10:42,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:10:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:10:42,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,550 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:10:42,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947203334] [2025-04-29 11:10:42,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947203334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:42,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848803893] [2025-04-29 11:10:42,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:42,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:42,615 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2025-04-29 11:10:42,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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:10:42,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2025-04-29 11:10:42,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,776 INFO L116 PetriNetUnfolderBase]: 131/506 cut-off events. [2025-04-29 11:10:42,776 INFO L117 PetriNetUnfolderBase]: For 134/136 co-relation queries the response was YES. [2025-04-29 11:10:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 506 events. 131/506 cut-off events. For 134/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2628 event pairs, 23 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 1014. Up to 240 conditions per place. [2025-04-29 11:10:42,783 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2025-04-29 11:10:42,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 155 transitions, 675 flow [2025-04-29 11:10:42,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-04-29 11:10:42,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8705673758865248 [2025-04-29 11:10:42,788 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 353 flow. Second operand 6 states and 491 transitions. [2025-04-29 11:10:42,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 155 transitions, 675 flow [2025-04-29 11:10:42,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:42,795 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2025-04-29 11:10:42,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2025-04-29 11:10:42,799 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2025-04-29 11:10:42,799 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2025-04-29 11:10:42,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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:10:42,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:42,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:42,800 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:42,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1380224570, now seen corresponding path program 1 times [2025-04-29 11:10:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378944114] [2025-04-29 11:10:42,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:10:42,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:10:42,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,088 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:10:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378944114] [2025-04-29 11:10:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378944114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730259998] [2025-04-29 11:10:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:43,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2025-04-29 11:10:43,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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:10:43,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2025-04-29 11:10:43,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,302 INFO L116 PetriNetUnfolderBase]: 142/514 cut-off events. [2025-04-29 11:10:43,302 INFO L117 PetriNetUnfolderBase]: For 443/453 co-relation queries the response was YES. [2025-04-29 11:10:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 514 events. 142/514 cut-off events. For 443/453 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2855 event pairs, 10 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2025-04-29 11:10:43,305 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2025-04-29 11:10:43,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2025-04-29 11:10:43,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2025-04-29 11:10:43,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8315602836879432 [2025-04-29 11:10:43,307 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2025-04-29 11:10:43,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2025-04-29 11:10:43,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:43,314 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2025-04-29 11:10:43,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2025-04-29 11:10:43,315 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2025-04-29 11:10:43,315 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2025-04-29 11:10:43,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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:10:43,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,316 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] [2025-04-29 11:10:43,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:43,317 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:10:43,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 356074419, now seen corresponding path program 1 times [2025-04-29 11:10:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636412475] [2025-04-29 11:10:43,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:10:43,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:10:43,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:43,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:43,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:10:43,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:10:43,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:43,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:43,376 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:43,377 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-04-29 11:10:43,380 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:10:43,380 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:10:43,380 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-04-29 11:10:43,381 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:10:43,381 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:10:43,381 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:10:43,381 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:10:43,381 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:10:43,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:43,381 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:43,385 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:43,385 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:10:43,409 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:10:43,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 246 flow [2025-04-29 11:10:43,438 INFO L116 PetriNetUnfolderBase]: 4/216 cut-off events. [2025-04-29 11:10:43,442 INFO L117 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-04-29 11:10:43,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 4/216 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 480 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2025-04-29 11:10:43,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 246 flow [2025-04-29 11:10:43,444 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 246 flow [2025-04-29 11:10:43,445 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:43,447 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;@1ca73573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:43,447 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-29 11:10:43,449 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:43,449 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:43,449 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:43,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,450 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] [2025-04-29 11:10:43,450 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:43,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 100644672, now seen corresponding path program 1 times [2025-04-29 11:10:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474421918] [2025-04-29 11:10:43,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:43,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:43,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,465 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:10:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474421918] [2025-04-29 11:10:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474421918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044450504] [2025-04-29 11:10:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:43,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:43,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-04-29 11:10:43,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:10:43,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-04-29 11:10:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,522 INFO L116 PetriNetUnfolderBase]: 19/441 cut-off events. [2025-04-29 11:10:43,522 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:10:43,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1866 event pairs, 16 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2025-04-29 11:10:43,524 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-04-29 11:10:43,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2025-04-29 11:10:43,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-04-29 11:10:43,525 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-04-29 11:10:43,525 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 246 flow. Second operand 3 states and 315 transitions. [2025-04-29 11:10:43,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2025-04-29 11:10:43,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:43,527 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2025-04-29 11:10:43,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-04-29 11:10:43,528 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2025-04-29 11:10:43,528 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2025-04-29 11:10:43,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:10:43,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,528 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] [2025-04-29 11:10:43,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:43,528 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:43,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1102311631, now seen corresponding path program 1 times [2025-04-29 11:10:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483753050] [2025-04-29 11:10:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:43,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:43,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,545 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:10:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483753050] [2025-04-29 11:10:43,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483753050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:43,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441034634] [2025-04-29 11:10:43,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:43,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:43,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:43,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-04-29 11:10:43,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:10:43,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-04-29 11:10:43,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,601 INFO L116 PetriNetUnfolderBase]: 48/598 cut-off events. [2025-04-29 11:10:43,602 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-29 11:10:43,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2948 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2025-04-29 11:10:43,604 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-04-29 11:10:43,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2025-04-29 11:10:43,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2025-04-29 11:10:43,606 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9217391304347826 [2025-04-29 11:10:43,606 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2025-04-29 11:10:43,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2025-04-29 11:10:43,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:43,607 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2025-04-29 11:10:43,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-04-29 11:10:43,607 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-04-29 11:10:43,608 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2025-04-29 11:10:43,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:10:43,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,608 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] [2025-04-29 11:10:43,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:10:43,608 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:43,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 141167895, now seen corresponding path program 1 times [2025-04-29 11:10:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728431643] [2025-04-29 11:10:43,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:43,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:43,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,649 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:10:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728431643] [2025-04-29 11:10:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728431643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520509323] [2025-04-29 11:10:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:43,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:43,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-04-29 11:10:43,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:10:43,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-04-29 11:10:43,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,758 INFO L116 PetriNetUnfolderBase]: 12/349 cut-off events. [2025-04-29 11:10:43,758 INFO L117 PetriNetUnfolderBase]: For 35/55 co-relation queries the response was YES. [2025-04-29 11:10:43,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 349 events. 12/349 cut-off events. For 35/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1208 event pairs, 2 based on Foata normal form. 2/331 useless extension candidates. Maximal degree in co-relation 227. Up to 39 conditions per place. [2025-04-29 11:10:43,759 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 14 selfloop transitions, 2 changer transitions 5/118 dead transitions. [2025-04-29 11:10:43,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 309 flow [2025-04-29 11:10:43,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-04-29 11:10:43,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-04-29 11:10:43,761 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 616 transitions. [2025-04-29 11:10:43,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 309 flow [2025-04-29 11:10:43,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 309 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:43,762 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 277 flow [2025-04-29 11:10:43,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2025-04-29 11:10:43,763 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2025-04-29 11:10:43,763 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 277 flow [2025-04-29 11:10:43,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:10:43,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,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] [2025-04-29 11:10:43,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:10:43,764 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:43,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1781759740, now seen corresponding path program 1 times [2025-04-29 11:10:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428950960] [2025-04-29 11:10:43,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:43,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:43,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,926 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:10:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428950960] [2025-04-29 11:10:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428950960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288974158] [2025-04-29 11:10:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2025-04-29 11:10:44,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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:10:44,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2025-04-29 11:10:44,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,348 INFO L116 PetriNetUnfolderBase]: 1008/3102 cut-off events. [2025-04-29 11:10:44,349 INFO L117 PetriNetUnfolderBase]: For 201/207 co-relation queries the response was YES. [2025-04-29 11:10:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5157 conditions, 3102 events. 1008/3102 cut-off events. For 201/207 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 25431 event pairs, 589 based on Foata normal form. 0/2810 useless extension candidates. Maximal degree in co-relation 4564. Up to 1573 conditions per place. [2025-04-29 11:10:44,368 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 31 selfloop transitions, 38 changer transitions 0/151 dead transitions. [2025-04-29 11:10:44,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 496 flow [2025-04-29 11:10:44,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2025-04-29 11:10:44,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8304347826086956 [2025-04-29 11:10:44,370 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 277 flow. Second operand 6 states and 573 transitions. [2025-04-29 11:10:44,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 496 flow [2025-04-29 11:10:44,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 151 transitions, 484 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:44,374 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 519 flow [2025-04-29 11:10:44,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=127, PETRI_TRANSITIONS=150} [2025-04-29 11:10:44,375 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2025-04-29 11:10:44,375 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 519 flow [2025-04-29 11:10:44,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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:10:44,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:44,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:10:44,375 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:44,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1117609092, now seen corresponding path program 1 times [2025-04-29 11:10:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018403024] [2025-04-29 11:10:44,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:10:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:10:44,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,587 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:10:44,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018403024] [2025-04-29 11:10:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018403024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414018741] [2025-04-29 11:10:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,679 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-04-29 11:10:44,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:10:44,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-04-29 11:10:44,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:45,311 INFO L116 PetriNetUnfolderBase]: 2425/6842 cut-off events. [2025-04-29 11:10:45,311 INFO L117 PetriNetUnfolderBase]: For 1851/2218 co-relation queries the response was YES. [2025-04-29 11:10:45,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14825 conditions, 6842 events. 2425/6842 cut-off events. For 1851/2218 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 62497 event pairs, 537 based on Foata normal form. 17/6295 useless extension candidates. Maximal degree in co-relation 12395. Up to 2882 conditions per place. [2025-04-29 11:10:45,347 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2025-04-29 11:10:45,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 260 transitions, 1347 flow [2025-04-29 11:10:45,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2025-04-29 11:10:45,349 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9028985507246376 [2025-04-29 11:10:45,349 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 519 flow. Second operand 6 states and 623 transitions. [2025-04-29 11:10:45,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 260 transitions, 1347 flow [2025-04-29 11:10:45,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:45,360 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2025-04-29 11:10:45,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2025-04-29 11:10:45,362 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2025-04-29 11:10:45,362 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2025-04-29 11:10:45,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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:10:45,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:45,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:45,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:10:45,363 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:45,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1570685696, now seen corresponding path program 1 times [2025-04-29 11:10:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:45,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151380288] [2025-04-29 11:10:45,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:45,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:10:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:10:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:45,568 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:10:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:45,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151380288] [2025-04-29 11:10:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151380288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:45,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738614554] [2025-04-29 11:10:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:45,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:45,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:45,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:45,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:45,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2025-04-29 11:10:45,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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:10:45,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:45,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2025-04-29 11:10:45,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:46,485 INFO L116 PetriNetUnfolderBase]: 3064/8860 cut-off events. [2025-04-29 11:10:46,486 INFO L117 PetriNetUnfolderBase]: For 6878/7099 co-relation queries the response was YES. [2025-04-29 11:10:46,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 8860 events. 3064/8860 cut-off events. For 6878/7099 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 88144 event pairs, 525 based on Foata normal form. 14/8296 useless extension candidates. Maximal degree in co-relation 23620. Up to 4186 conditions per place. [2025-04-29 11:10:46,540 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2025-04-29 11:10:46,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2025-04-29 11:10:46,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-04-29 11:10:46,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8463768115942029 [2025-04-29 11:10:46,542 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2025-04-29 11:10:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2025-04-29 11:10:46,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:46,569 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2025-04-29 11:10:46,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2025-04-29 11:10:46,570 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2025-04-29 11:10:46,570 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2025-04-29 11:10:46,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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:10:46,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:46,570 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:10:46,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:10:46,571 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:46,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash -879544048, now seen corresponding path program 1 times [2025-04-29 11:10:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:46,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593543894] [2025-04-29 11:10:46,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:10:46,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:10:46,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:46,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:46,934 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:10:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:46,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593543894] [2025-04-29 11:10:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593543894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535457378] [2025-04-29 11:10:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:46,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:46,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:46,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:47,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 115 [2025-04-29 11:10:47,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 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:10:47,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:47,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 115 [2025-04-29 11:10:47,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:48,260 INFO L116 PetriNetUnfolderBase]: 3384/9636 cut-off events. [2025-04-29 11:10:48,260 INFO L117 PetriNetUnfolderBase]: For 13180/13549 co-relation queries the response was YES. [2025-04-29 11:10:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30622 conditions, 9636 events. 3384/9636 cut-off events. For 13180/13549 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 96474 event pairs, 480 based on Foata normal form. 112/9170 useless extension candidates. Maximal degree in co-relation 29350. Up to 3017 conditions per place. [2025-04-29 11:10:48,318 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 310 selfloop transitions, 36 changer transitions 0/430 dead transitions. [2025-04-29 11:10:48,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 430 transitions, 3901 flow [2025-04-29 11:10:48,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:10:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:10:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1074 transitions. [2025-04-29 11:10:48,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183946488294315 [2025-04-29 11:10:48,321 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 1074 transitions. [2025-04-29 11:10:48,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 430 transitions, 3901 flow [2025-04-29 11:10:48,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 430 transitions, 3761 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:48,351 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2025-04-29 11:10:48,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2025-04-29 11:10:48,352 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2025-04-29 11:10:48,352 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2025-04-29 11:10:48,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 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:10:48,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:48,352 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:10:48,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:10:48,353 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:48,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash -31506210, now seen corresponding path program 1 times [2025-04-29 11:10:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:48,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256877076] [2025-04-29 11:10:48,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:48,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:10:48,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:10:48,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:48,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:48,653 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:10:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:48,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256877076] [2025-04-29 11:10:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256877076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:48,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:48,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998718625] [2025-04-29 11:10:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:48,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:48,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:48,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:49,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-04-29 11:10:49,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:49,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:49,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-04-29 11:10:49,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:50,693 INFO L116 PetriNetUnfolderBase]: 5095/12951 cut-off events. [2025-04-29 11:10:50,693 INFO L117 PetriNetUnfolderBase]: For 18268/20086 co-relation queries the response was YES. [2025-04-29 11:10:50,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43697 conditions, 12951 events. 5095/12951 cut-off events. For 18268/20086 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 127514 event pairs, 623 based on Foata normal form. 292/12707 useless extension candidates. Maximal degree in co-relation 39791. Up to 3162 conditions per place. [2025-04-29 11:10:50,764 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2025-04-29 11:10:50,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2025-04-29 11:10:50,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:10:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:10:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2025-04-29 11:10:50,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7695652173913043 [2025-04-29 11:10:50,770 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2025-04-29 11:10:50,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2025-04-29 11:10:50,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:10:50,821 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2025-04-29 11:10:50,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2025-04-29 11:10:50,823 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2025-04-29 11:10:50,824 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2025-04-29 11:10:50,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:50,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:50,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:50,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:10:50,824 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:50,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 713914109, now seen corresponding path program 1 times [2025-04-29 11:10:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:50,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506872475] [2025-04-29 11:10:50,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:50,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:10:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:10:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:51,096 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:10:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:51,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506872475] [2025-04-29 11:10:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506872475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:10:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857489188] [2025-04-29 11:10:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:51,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:10:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:51,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:10:51,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:10:51,488 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-04-29 11:10:51,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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:10:51,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:51,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-04-29 11:10:51,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:52,896 INFO L116 PetriNetUnfolderBase]: 4493/12023 cut-off events. [2025-04-29 11:10:52,896 INFO L117 PetriNetUnfolderBase]: For 34193/34708 co-relation queries the response was YES. [2025-04-29 11:10:52,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48059 conditions, 12023 events. 4493/12023 cut-off events. For 34193/34708 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 120562 event pairs, 436 based on Foata normal form. 184/11641 useless extension candidates. Maximal degree in co-relation 46684. Up to 3249 conditions per place. [2025-04-29 11:10:52,966 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2025-04-29 11:10:52,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2025-04-29 11:10:52,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:10:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:10:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2025-04-29 11:10:52,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7344481605351171 [2025-04-29 11:10:52,969 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2025-04-29 11:10:52,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2025-04-29 11:10:53,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:53,102 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2025-04-29 11:10:53,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2025-04-29 11:10:53,105 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2025-04-29 11:10:53,105 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2025-04-29 11:10:53,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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:10:53,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:53,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:53,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:10:53,106 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:53,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1933177375, now seen corresponding path program 1 times [2025-04-29 11:10:53,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:53,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143803803] [2025-04-29 11:10:53,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:53,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:53,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:10:53,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:10:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:53,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:10:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:53,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143803803] [2025-04-29 11:10:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143803803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:53,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:53,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:53,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199023667] [2025-04-29 11:10:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:53,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:53,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:53,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:53,362 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-04-29 11:10:53,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:53,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:53,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-04-29 11:10:53,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:54,200 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L21-6-->L21-7: Formula: (= |v_#race_21| (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread2of2ForFork0_#t~nondet1_3|))) InVars {#race=|v_#race_22|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_21|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, ~datas~0.offset=v_~datas~0.offset_4, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 204#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 141#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 223#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 129#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 152#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 118#true, 239#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 263#(= |threadThread2of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 95#L42-1true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 153#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 221#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 151#(= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 217#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 161#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), 138#true, Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 123#true, 202#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 203#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 59#L21-11true, Black: 205#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 29#L21-7true, Black: 142#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, 159#true, 125#(= |#race~datas~0| 0), Black: 143#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 116#true, Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet1| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 197#true, Black: 140#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)]) [2025-04-29 11:10:54,200 INFO L286 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-04-29 11:10:54,201 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-29 11:10:54,201 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-29 11:10:54,201 INFO L289 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-04-29 11:10:56,192 INFO L116 PetriNetUnfolderBase]: 9684/22047 cut-off events. [2025-04-29 11:10:56,192 INFO L117 PetriNetUnfolderBase]: For 73917/74774 co-relation queries the response was YES. [2025-04-29 11:10:56,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90111 conditions, 22047 events. 9684/22047 cut-off events. For 73917/74774 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 225964 event pairs, 1081 based on Foata normal form. 11/20914 useless extension candidates. Maximal degree in co-relation 88021. Up to 11088 conditions per place. [2025-04-29 11:10:56,324 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2025-04-29 11:10:56,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2025-04-29 11:10:56,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-04-29 11:10:56,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8971014492753623 [2025-04-29 11:10:56,326 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2025-04-29 11:10:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2025-04-29 11:10:56,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:10:56,639 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2025-04-29 11:10:56,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2025-04-29 11:10:56,639 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2025-04-29 11:10:56,640 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2025-04-29 11:10:56,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:56,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,640 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, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:56,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:10:56,640 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-04-29 11:10:56,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash -786696197, now seen corresponding path program 1 times [2025-04-29 11:10:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076996053] [2025-04-29 11:10:56,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:10:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:10:56,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:56,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:56,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 11:10:56,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 11:10:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:56,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:56,679 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:56,679 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-04-29 11:10:56,680 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-04-29 11:10:56,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:10:56,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:56,681 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:10:56,681 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:10:56,702 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:10:56,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 299 flow [2025-04-29 11:10:56,725 INFO L116 PetriNetUnfolderBase]: 9/356 cut-off events. [2025-04-29 11:10:56,725 INFO L117 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-04-29 11:10:56,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 356 events. 9/356 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1013 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 224. Up to 12 conditions per place. [2025-04-29 11:10:56,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 299 flow [2025-04-29 11:10:56,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 299 flow [2025-04-29 11:10:56,729 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:56,729 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;@1ca73573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:56,729 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:10:56,730 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:56,730 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:10:56,730 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:56,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,730 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] [2025-04-29 11:10:56,731 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:56,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1801198792, now seen corresponding path program 1 times [2025-04-29 11:10:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612480204] [2025-04-29 11:10:56,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:10:56,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:10:56,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,744 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:10:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612480204] [2025-04-29 11:10:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612480204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98238266] [2025-04-29 11:10:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:56,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:56,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:56,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:56,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-04-29 11:10:56,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 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:10:56,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:56,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-04-29 11:10:56,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:56,840 INFO L116 PetriNetUnfolderBase]: 90/1260 cut-off events. [2025-04-29 11:10:56,840 INFO L117 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-04-29 11:10:56,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8328 event pairs, 81 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2025-04-29 11:10:56,846 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-04-29 11:10:56,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2025-04-29 11:10:56,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-04-29 11:10:56,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-04-29 11:10:56,848 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 299 flow. Second operand 3 states and 372 transitions. [2025-04-29 11:10:56,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2025-04-29 11:10:56,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:56,850 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2025-04-29 11:10:56,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2025-04-29 11:10:56,851 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2025-04-29 11:10:56,851 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2025-04-29 11:10:56,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 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:10:56,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:56,852 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] [2025-04-29 11:10:56,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:10:56,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:56,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 907219407, now seen corresponding path program 1 times [2025-04-29 11:10:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:56,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072512256] [2025-04-29 11:10:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:56,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:56,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:56,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:56,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:56,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,864 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:10:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072512256] [2025-04-29 11:10:56,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072512256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:56,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:56,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:10:56,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14762024] [2025-04-29 11:10:56,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:56,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:10:56,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:56,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:10:56,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:10:56,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-04-29 11:10:56,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:10:56,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:56,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-04-29 11:10:56,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,011 INFO L116 PetriNetUnfolderBase]: 307/2452 cut-off events. [2025-04-29 11:10:57,011 INFO L117 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2025-04-29 11:10:57,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19875 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2025-04-29 11:10:57,021 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-04-29 11:10:57,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2025-04-29 11:10:57,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:10:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:10:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-04-29 11:10:57,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9142156862745098 [2025-04-29 11:10:57,022 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2025-04-29 11:10:57,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2025-04-29 11:10:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:57,023 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2025-04-29 11:10:57,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-04-29 11:10:57,024 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2025-04-29 11:10:57,024 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2025-04-29 11:10:57,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:10:57,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,024 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] [2025-04-29 11:10:57,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:10:57,025 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:57,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1636106007, now seen corresponding path program 1 times [2025-04-29 11:10:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529347915] [2025-04-29 11:10:57,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:57,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:57,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:57,058 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:10:57,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:57,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529347915] [2025-04-29 11:10:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529347915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407864448] [2025-04-29 11:10:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:57,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:57,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:57,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-04-29 11:10:57,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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:10:57,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-04-29 11:10:57,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:57,176 INFO L116 PetriNetUnfolderBase]: 50/845 cut-off events. [2025-04-29 11:10:57,176 INFO L117 PetriNetUnfolderBase]: For 130/199 co-relation queries the response was YES. [2025-04-29 11:10:57,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 845 events. 50/845 cut-off events. For 130/199 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4629 event pairs, 16 based on Foata normal form. 2/787 useless extension candidates. Maximal degree in co-relation 613. Up to 99 conditions per place. [2025-04-29 11:10:57,181 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 16 selfloop transitions, 2 changer transitions 5/139 dead transitions. [2025-04-29 11:10:57,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 371 flow [2025-04-29 11:10:57,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-04-29 11:10:57,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-04-29 11:10:57,182 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 732 transitions. [2025-04-29 11:10:57,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 371 flow [2025-04-29 11:10:57,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:57,184 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 335 flow [2025-04-29 11:10:57,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2025-04-29 11:10:57,184 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-04-29 11:10:57,184 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 335 flow [2025-04-29 11:10:57,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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:10:57,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:57,184 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] [2025-04-29 11:10:57,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:10:57,185 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:57,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -286821628, now seen corresponding path program 1 times [2025-04-29 11:10:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:57,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141922408] [2025-04-29 11:10:57,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:57,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:10:57,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:10:57,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:57,290 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:10:57,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:57,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141922408] [2025-04-29 11:10:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141922408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911903255] [2025-04-29 11:10:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:57,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:57,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:57,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 136 [2025-04-29 11:10:57,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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:10:57,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:57,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 136 [2025-04-29 11:10:57,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:59,071 INFO L116 PetriNetUnfolderBase]: 10339/23614 cut-off events. [2025-04-29 11:10:59,071 INFO L117 PetriNetUnfolderBase]: For 2046/2115 co-relation queries the response was YES. [2025-04-29 11:10:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40662 conditions, 23614 events. 10339/23614 cut-off events. For 2046/2115 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 239046 event pairs, 6766 based on Foata normal form. 0/21688 useless extension candidates. Maximal degree in co-relation 35435. Up to 14073 conditions per place. [2025-04-29 11:10:59,190 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 38 selfloop transitions, 54 changer transitions 0/189 dead transitions. [2025-04-29 11:10:59,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 641 flow [2025-04-29 11:10:59,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2025-04-29 11:10:59,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8406862745098039 [2025-04-29 11:10:59,192 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 335 flow. Second operand 6 states and 686 transitions. [2025-04-29 11:10:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 641 flow [2025-04-29 11:10:59,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 629 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:59,197 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 681 flow [2025-04-29 11:10:59,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=148, PETRI_TRANSITIONS=187} [2025-04-29 11:10:59,198 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-04-29 11:10:59,198 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 681 flow [2025-04-29 11:10:59,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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:10:59,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:59,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:59,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:10:59,198 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:10:59,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash -268943369, now seen corresponding path program 1 times [2025-04-29 11:10:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:59,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416119792] [2025-04-29 11:10:59,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:59,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:10:59,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:10:59,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:59,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:59,321 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:10:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:59,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416119792] [2025-04-29 11:10:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416119792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370379632] [2025-04-29 11:10:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:59,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:59,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:59,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:59,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-04-29 11:10:59,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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:10:59,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:59,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-04-29 11:10:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:02,628 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][290], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 14#L34-9true, 84#L21-8true, Black: 145#true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 136#true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 138#true, 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 121#L21-11true, 92#L21-7true]) [2025-04-29 11:11:02,628 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-29 11:11:02,628 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:11:02,628 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:11:02,628 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:11:02,756 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][290], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 14#L34-9true, Black: 145#true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 136#true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 138#true, 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 21#L21-9true, 92#L21-7true, 121#L21-11true]) [2025-04-29 11:11:02,756 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,756 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,756 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,756 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,852 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][234], [75#L21-7true, Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 14#L34-9true, 70#L22true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 145#true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 136#true, 171#true, 147#(= |#race~datas~0| 0), 140#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 138#true, 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 92#L21-7true]) [2025-04-29 11:11:02,852 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,852 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,852 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,853 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:02,874 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][290], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), 14#L34-9true, Black: 145#true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 136#true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 138#true, 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 121#L21-11true, 89#L21-10true, 92#L21-7true]) [2025-04-29 11:11:02,874 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-29 11:11:02,874 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-29 11:11:02,874 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-29 11:11:02,874 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-29 11:11:05,164 INFO L116 PetriNetUnfolderBase]: 29136/67128 cut-off events. [2025-04-29 11:11:05,164 INFO L117 PetriNetUnfolderBase]: For 19654/23389 co-relation queries the response was YES. [2025-04-29 11:11:05,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150629 conditions, 67128 events. 29136/67128 cut-off events. For 19654/23389 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 771652 event pairs, 6980 based on Foata normal form. 74/61731 useless extension candidates. Maximal degree in co-relation 123429. Up to 28812 conditions per place. [2025-04-29 11:11:05,792 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2025-04-29 11:11:05,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 349 transitions, 1945 flow [2025-04-29 11:11:05,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2025-04-29 11:11:05,794 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9105392156862745 [2025-04-29 11:11:05,794 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 681 flow. Second operand 6 states and 743 transitions. [2025-04-29 11:11:05,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 349 transitions, 1945 flow [2025-04-29 11:11:05,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:05,872 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2025-04-29 11:11:05,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2025-04-29 11:11:05,873 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2025-04-29 11:11:05,873 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2025-04-29 11:11:05,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 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:05,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:05,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:05,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:05,873 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:05,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 349766555, now seen corresponding path program 1 times [2025-04-29 11:11:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:05,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974329308] [2025-04-29 11:11:05,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:11:05,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:11:05,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:05,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:06,041 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:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:06,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974329308] [2025-04-29 11:11:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974329308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530979669] [2025-04-29 11:11:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:06,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:06,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:06,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 136 [2025-04-29 11:11:06,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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:06,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:06,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 136 [2025-04-29 11:11:06,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:14,027 INFO L116 PetriNetUnfolderBase]: 35364/83027 cut-off events. [2025-04-29 11:11:14,027 INFO L117 PetriNetUnfolderBase]: For 74887/77593 co-relation queries the response was YES. [2025-04-29 11:11:14,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242543 conditions, 83027 events. 35364/83027 cut-off events. For 74887/77593 co-relation queries the response was YES. Maximal size of possible extension queue 2682. Compared 1006379 event pairs, 8907 based on Foata normal form. 169/77418 useless extension candidates. Maximal degree in co-relation 232580. Up to 43594 conditions per place. [2025-04-29 11:11:14,795 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2025-04-29 11:11:14,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2025-04-29 11:11:14,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2025-04-29 11:11:14,796 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-04-29 11:11:14,796 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2025-04-29 11:11:14,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2025-04-29 11:11:15,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:15,412 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2025-04-29 11:11:15,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2025-04-29 11:11:15,413 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2025-04-29 11:11:15,413 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2025-04-29 11:11:15,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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:15,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:15,413 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-04-29 11:11:15,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:15,414 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:11:15,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1508087049, now seen corresponding path program 1 times [2025-04-29 11:11:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:15,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154403678] [2025-04-29 11:11:15,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:15,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:11:15,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:11:15,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:15,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:15,710 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:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:15,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154403678] [2025-04-29 11:11:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154403678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189464386] [2025-04-29 11:11:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:15,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:11:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:15,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:11:15,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:11:16,253 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 136 [2025-04-29 11:11:16,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 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:16,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:16,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 136 [2025-04-29 11:11:16,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:21,701 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][336], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), 218#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, 138#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 92#L21-7true, Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 75#L21-7true, 14#L34-9true, 70#L22true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 145#true, 136#true, 171#true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|), 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|))]) [2025-04-29 11:11:21,701 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,701 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,702 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,702 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,795 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][373], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 138#true, 68#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 92#L21-7true, Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 120#L21-10true, Black: 145#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 136#true, 171#true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|), 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), 89#L21-10true, Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|))]) [2025-04-29 11:11:21,795 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,795 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,795 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:21,795 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-29 11:11:23,196 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L21-6-->L21-7: Formula: (= (store |v_#race_22| v_~datas~0.base_4 (store (select |v_#race_22| v_~datas~0.base_4) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_4) |v_threadThread3of3ForFork0_#t~nondet1_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} OutVars{#race=|v_#race_21|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_3|, ~datas~0.base=v_~datas~0.base_4, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_4} AuxVars[] AssignedVars[#race][373], [Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 147#(= |#race~datas~0| 0), Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 181#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|)), 138#true, 21#L21-9true, 68#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 92#L21-7true, Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 120#L21-10true, Black: 145#true, Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 136#true, 171#true, 140#true, Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|), 160#true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet1|))]) [2025-04-29 11:11:23,197 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-29 11:11:23,197 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:11:23,197 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-29 11:11:23,197 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event