./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/pthread-ext/14_spin2003.i -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 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:44:15,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:44:15,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:44:15,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:44:15,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:44:15,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:44:15,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:44:15,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:44:15,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:44:15,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:44:15,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:44:15,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:44:15,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:44:15,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:44:15,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:44:15,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:15,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:44:15,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:44:15,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:44:15,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:44:15,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:44:15,951 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 -> 83bca07672f78100877a79a1440d2a8107bad3ebb200d176bee629abfa2ef706 [2025-03-17 10:44:16,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:44:16,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:44:16,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:44:16,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:44:16,189 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:44:16,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-17 10:44:17,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0749f840/bc9849b986ac41068ed199fccd991bc0/FLAG46e550920 [2025-03-17 10:44:17,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:44:17,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2025-03-17 10:44:17,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0749f840/bc9849b986ac41068ed199fccd991bc0/FLAG46e550920 [2025-03-17 10:44:17,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0749f840/bc9849b986ac41068ed199fccd991bc0 [2025-03-17 10:44:17,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:44:17,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:44:17,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:17,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:44:17,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:44:17,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30be30f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17, skipping insertion in model container [2025-03-17 10:44:17,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:44:17,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:17,830 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:44:17,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:17,897 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:44:17,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17 WrapperNode [2025-03-17 10:44:17,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:17,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:17,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:44:17,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:44:17,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,926 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-17 10:44:17,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:17,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:44:17,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:44:17,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:44:17,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:44:17,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:44:17,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:44:17,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:44:17,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (1/1) ... [2025-03-17 10:44:17,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:17,979 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-03-17 10:44:17,982 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-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:44:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:44:18,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:44:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:44:18,003 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:44:18,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:44:18,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:44:18,214 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:44:18,214 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:44:18,231 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:44:18,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:44:18,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:18 BoogieIcfgContainer [2025-03-17 10:44:18,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:44:18,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:44:18,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:44:18,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:44:18,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:44:17" (1/3) ... [2025-03-17 10:44:18,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1460abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:18, skipping insertion in model container [2025-03-17 10:44:18,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:17" (2/3) ... [2025-03-17 10:44:18,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1460abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:18, skipping insertion in model container [2025-03-17 10:44:18,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:18" (3/3) ... [2025-03-17 10:44:18,242 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-03-17 10:44:18,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:44:18,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-17 10:44:18,253 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:44:18,295 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:18,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 116 flow [2025-03-17 10:44:18,363 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-03-17 10:44:18,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:18,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-17 10:44:18,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 116 flow [2025-03-17 10:44:18,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 56 transitions, 116 flow [2025-03-17 10:44:18,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:18,392 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fe0fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:18,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 10:44:18,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:18,400 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-17 10:44:18,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:18,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:18,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:18,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-17 10:44:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1397617564, now seen corresponding path program 1 times [2025-03-17 10:44:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88224262] [2025-03-17 10:44:18,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 10:44:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 10:44:18,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 10:44:18,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 10:44:18,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:18,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:18,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-17 10:44:18,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-17 10:44:18,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-17 10:44:18,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-17 10:44:18,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-17 10:44:18,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-17 10:44:18,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-17 10:44:18,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:44:18,551 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-17 10:44:18,553 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:18,555 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:44:18,587 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:18,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 184 flow [2025-03-17 10:44:18,621 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2025-03-17 10:44:18,623 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:44:18,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 177 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 67. Up to 3 conditions per place. [2025-03-17 10:44:18,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 87 transitions, 184 flow [2025-03-17 10:44:18,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 87 transitions, 184 flow [2025-03-17 10:44:18,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:18,631 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fe0fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:18,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 10:44:18,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:18,644 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-17 10:44:18,644 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:44:18,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:18,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:18,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 10:44:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2037761239, now seen corresponding path program 1 times [2025-03-17 10:44:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681868921] [2025-03-17 10:44:18,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:18,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:44:18,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:44:18,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681868921] [2025-03-17 10:44:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681868921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716106903] [2025-03-17 10:44:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:18,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:18,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:18,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:18,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 87 [2025-03-17 10:44:18,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-03-17 10:44:18,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:18,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 87 [2025-03-17 10:44:18,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:18,914 INFO L124 PetriNetUnfolderBase]: 57/327 cut-off events. [2025-03-17 10:44:18,916 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 10:44:18,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 327 events. 57/327 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1642 event pairs, 37 based on Foata normal form. 110/392 useless extension candidates. Maximal degree in co-relation 383. Up to 109 conditions per place. [2025-03-17 10:44:18,921 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 18 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-03-17 10:44:18,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 229 flow [2025-03-17 10:44:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2025-03-17 10:44:18,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2025-03-17 10:44:18,934 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 184 flow. Second operand 3 states and 225 transitions. [2025-03-17 10:44:18,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 229 flow [2025-03-17 10:44:18,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:18,940 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 206 flow [2025-03-17 10:44:18,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2025-03-17 10:44:18,945 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2025-03-17 10:44:18,946 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 206 flow [2025-03-17 10:44:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-03-17 10:44:18,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:18,947 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:18,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:44:18,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-17 10:44:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -885922662, now seen corresponding path program 1 times [2025-03-17 10:44:18,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812758300] [2025-03-17 10:44:18,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 10:44:18,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 10:44:18,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,969 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:18,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 10:44:18,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 10:44:18,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:18,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:18,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 10:44:18,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 10:44:19,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 10:44:19,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:44:19,000 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 10:44:19,001 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:19,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:44:19,031 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:19,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 118 transitions, 254 flow [2025-03-17 10:44:19,046 INFO L124 PetriNetUnfolderBase]: 6/139 cut-off events. [2025-03-17 10:44:19,046 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:44:19,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 6/139 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 350 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2025-03-17 10:44:19,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 118 transitions, 254 flow [2025-03-17 10:44:19,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 254 flow [2025-03-17 10:44:19,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:19,049 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fe0fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:19,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 10:44:19,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:19,055 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-17 10:44:19,055 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:44:19,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:19,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-17 10:44:19,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash 287816651, now seen corresponding path program 1 times [2025-03-17 10:44:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84263167] [2025-03-17 10:44:19,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:19,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:44:19,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:44:19,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84263167] [2025-03-17 10:44:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84263167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:19,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533873928] [2025-03-17 10:44:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:19,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:19,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:19,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-03-17 10:44:19,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-03-17 10:44:19,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:19,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-03-17 10:44:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:19,407 INFO L124 PetriNetUnfolderBase]: 783/2639 cut-off events. [2025-03-17 10:44:19,407 INFO L125 PetriNetUnfolderBase]: For 427/427 co-relation queries the response was YES. [2025-03-17 10:44:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 2639 events. 783/2639 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 22957 event pairs, 558 based on Foata normal form. 842/3085 useless extension candidates. Maximal degree in co-relation 3328. Up to 1091 conditions per place. [2025-03-17 10:44:19,426 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 27 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2025-03-17 10:44:19,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 334 flow [2025-03-17 10:44:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-17 10:44:19,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.867231638418079 [2025-03-17 10:44:19,430 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 254 flow. Second operand 3 states and 307 transitions. [2025-03-17 10:44:19,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 334 flow [2025-03-17 10:44:19,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 330 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:19,433 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 290 flow [2025-03-17 10:44:19,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-03-17 10:44:19,434 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -6 predicate places. [2025-03-17 10:44:19,435 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 290 flow [2025-03-17 10:44:19,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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-03-17 10:44:19,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,435 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 10:44:19,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:44:19,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-17 10:44:19,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1396655744, now seen corresponding path program 1 times [2025-03-17 10:44:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000650582] [2025-03-17 10:44:19,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:19,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:44:19,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:44:19,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000650582] [2025-03-17 10:44:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000650582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779834769] [2025-03-17 10:44:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:19,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:19,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:19,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:19,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 118 [2025-03-17 10:44:19,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03-17 10:44:19,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:19,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 118 [2025-03-17 10:44:19,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:19,856 INFO L124 PetriNetUnfolderBase]: 1172/3570 cut-off events. [2025-03-17 10:44:19,856 INFO L125 PetriNetUnfolderBase]: For 1101/1137 co-relation queries the response was YES. [2025-03-17 10:44:19,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 3570 events. 1172/3570 cut-off events. For 1101/1137 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 32005 event pairs, 677 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 6741. Up to 1502 conditions per place. [2025-03-17 10:44:19,877 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 31 selfloop transitions, 13 changer transitions 0/126 dead transitions. [2025-03-17 10:44:19,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 437 flow [2025-03-17 10:44:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-03-17 10:44:19,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-03-17 10:44:19,880 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 290 flow. Second operand 3 states and 294 transitions. [2025-03-17 10:44:19,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 437 flow [2025-03-17 10:44:19,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 126 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:44:19,891 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 384 flow [2025-03-17 10:44:19,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2025-03-17 10:44:19,893 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -4 predicate places. [2025-03-17 10:44:19,893 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 384 flow [2025-03-17 10:44:19,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03-17 10:44:19,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,894 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:19,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:44:19,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-17 10:44:19,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash -650405004, now seen corresponding path program 1 times [2025-03-17 10:44:19,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085261696] [2025-03-17 10:44:19,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:19,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:44:19,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:44:19,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:19,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:19,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:44:19,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:44:19,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:19,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:19,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:19,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 10:44:19,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 10:44:19,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 10:44:19,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 10:44:19,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 10:44:19,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 10:44:19,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 10:44:19,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 10:44:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:44:19,939 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 10:44:19,940 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:19,940 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 10:44:19,968 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:19,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 149 transitions, 326 flow [2025-03-17 10:44:19,989 INFO L124 PetriNetUnfolderBase]: 8/177 cut-off events. [2025-03-17 10:44:19,989 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 10:44:19,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 177 events. 8/177 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 528 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 147. Up to 5 conditions per place. [2025-03-17 10:44:19,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 149 transitions, 326 flow [2025-03-17 10:44:19,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 149 transitions, 326 flow [2025-03-17 10:44:19,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:19,993 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fe0fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:19,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 10:44:19,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:19,996 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-03-17 10:44:19,996 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:44:19,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,996 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] [2025-03-17 10:44:19,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:19,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1350104971, now seen corresponding path program 1 times [2025-03-17 10:44:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995229256] [2025-03-17 10:44:19,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:20,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:44:20,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:44:20,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:20,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:20,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995229256] [2025-03-17 10:44:20,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995229256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:20,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:20,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759942069] [2025-03-17 10:44:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:20,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:20,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:20,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:20,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-17 10:44:20,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:44:20,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:20,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-17 10:44:20,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:21,642 INFO L124 PetriNetUnfolderBase]: 7395/19445 cut-off events. [2025-03-17 10:44:21,643 INFO L125 PetriNetUnfolderBase]: For 4630/4630 co-relation queries the response was YES. [2025-03-17 10:44:21,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 19445 events. 7395/19445 cut-off events. For 4630/4630 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 215082 event pairs, 5493 based on Foata normal form. 6058/22743 useless extension candidates. Maximal degree in co-relation 25149. Up to 9127 conditions per place. [2025-03-17 10:44:21,845 INFO L140 encePairwiseOnDemand]: 127/149 looper letters, 36 selfloop transitions, 12 changer transitions 0/149 dead transitions. [2025-03-17 10:44:21,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 149 transitions, 443 flow [2025-03-17 10:44:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-17 10:44:21,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702460850111857 [2025-03-17 10:44:21,847 INFO L175 Difference]: Start difference. First operand has 150 places, 149 transitions, 326 flow. Second operand 3 states and 389 transitions. [2025-03-17 10:44:21,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 149 transitions, 443 flow [2025-03-17 10:44:21,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 431 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:21,852 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 374 flow [2025-03-17 10:44:21,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2025-03-17 10:44:21,853 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -8 predicate places. [2025-03-17 10:44:21,853 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 374 flow [2025-03-17 10:44:21,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:44:21,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:21,853 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 10:44:21,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:44:21,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:21,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1300958302, now seen corresponding path program 1 times [2025-03-17 10:44:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:21,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408720505] [2025-03-17 10:44:21,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:21,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:44:21,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:44:21,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:21,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408720505] [2025-03-17 10:44:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408720505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:21,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425275917] [2025-03-17 10:44:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:21,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:21,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:21,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:21,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-17 10:44:21,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-03-17 10:44:21,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:21,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-17 10:44:21,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:23,862 INFO L124 PetriNetUnfolderBase]: 11941/28835 cut-off events. [2025-03-17 10:44:23,862 INFO L125 PetriNetUnfolderBase]: For 9721/10578 co-relation queries the response was YES. [2025-03-17 10:44:23,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57848 conditions, 28835 events. 11941/28835 cut-off events. For 9721/10578 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 323166 event pairs, 7371 based on Foata normal form. 15/24818 useless extension candidates. Maximal degree in co-relation 57748. Up to 13802 conditions per place. [2025-03-17 10:44:24,110 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 43 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2025-03-17 10:44:24,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 165 transitions, 598 flow [2025-03-17 10:44:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-17 10:44:24,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8322147651006712 [2025-03-17 10:44:24,112 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 374 flow. Second operand 3 states and 372 transitions. [2025-03-17 10:44:24,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 165 transitions, 598 flow [2025-03-17 10:44:24,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 165 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:44:24,162 INFO L231 Difference]: Finished difference. Result has 144 places, 157 transitions, 522 flow [2025-03-17 10:44:24,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=144, PETRI_TRANSITIONS=157} [2025-03-17 10:44:24,163 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -6 predicate places. [2025-03-17 10:44:24,163 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 157 transitions, 522 flow [2025-03-17 10:44:24,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-03-17 10:44:24,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:24,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:24,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:44:24,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:24,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1044519403, now seen corresponding path program 1 times [2025-03-17 10:44:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:24,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51760082] [2025-03-17 10:44:24,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:24,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:44:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:44:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:24,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51760082] [2025-03-17 10:44:24,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51760082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:24,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:24,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391838440] [2025-03-17 10:44:24,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:24,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:24,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:24,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:24,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-17 10:44:24,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 157 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-03-17 10:44:24,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-17 10:44:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:27,104 INFO L124 PetriNetUnfolderBase]: 15835/37991 cut-off events. [2025-03-17 10:44:27,105 INFO L125 PetriNetUnfolderBase]: For 28390/30278 co-relation queries the response was YES. [2025-03-17 10:44:27,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87085 conditions, 37991 events. 15835/37991 cut-off events. For 28390/30278 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 442012 event pairs, 8895 based on Foata normal form. 23/32240 useless extension candidates. Maximal degree in co-relation 86963. Up to 17896 conditions per place. [2025-03-17 10:44:27,437 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 59 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2025-03-17 10:44:27,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 183 transitions, 815 flow [2025-03-17 10:44:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-17 10:44:27,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8344519015659956 [2025-03-17 10:44:27,439 INFO L175 Difference]: Start difference. First operand has 144 places, 157 transitions, 522 flow. Second operand 3 states and 373 transitions. [2025-03-17 10:44:27,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 183 transitions, 815 flow [2025-03-17 10:44:27,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 763 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:44:27,513 INFO L231 Difference]: Finished difference. Result has 146 places, 174 transitions, 686 flow [2025-03-17 10:44:27,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=146, PETRI_TRANSITIONS=174} [2025-03-17 10:44:27,515 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -4 predicate places. [2025-03-17 10:44:27,516 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 686 flow [2025-03-17 10:44:27,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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-03-17 10:44:27,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:27,516 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:27,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:44:27,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:27,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1477368672, now seen corresponding path program 1 times [2025-03-17 10:44:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250460225] [2025-03-17 10:44:27,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:27,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 10:44:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 10:44:27,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:27,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:27,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250460225] [2025-03-17 10:44:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250460225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:27,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783507454] [2025-03-17 10:44:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:27,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:27,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:27,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:27,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 149 [2025-03-17 10:44:27,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-03-17 10:44:27,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:27,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 149 [2025-03-17 10:44:27,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:31,369 INFO L124 PetriNetUnfolderBase]: 25435/56087 cut-off events. [2025-03-17 10:44:31,369 INFO L125 PetriNetUnfolderBase]: For 71908/74104 co-relation queries the response was YES. [2025-03-17 10:44:31,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146549 conditions, 56087 events. 25435/56087 cut-off events. For 71908/74104 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 650047 event pairs, 11736 based on Foata normal form. 56/46915 useless extension candidates. Maximal degree in co-relation 146440. Up to 26863 conditions per place. [2025-03-17 10:44:32,058 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 68 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2025-03-17 10:44:32,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 216 transitions, 1167 flow [2025-03-17 10:44:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-03-17 10:44:32,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299776286353467 [2025-03-17 10:44:32,060 INFO L175 Difference]: Start difference. First operand has 146 places, 174 transitions, 686 flow. Second operand 3 states and 371 transitions. [2025-03-17 10:44:32,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 216 transitions, 1167 flow [2025-03-17 10:44:32,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 1059 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-17 10:44:32,288 INFO L231 Difference]: Finished difference. Result has 148 places, 209 transitions, 1058 flow [2025-03-17 10:44:32,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=148, PETRI_TRANSITIONS=209} [2025-03-17 10:44:32,289 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, -2 predicate places. [2025-03-17 10:44:32,289 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 209 transitions, 1058 flow [2025-03-17 10:44:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-03-17 10:44:32,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:32,289 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-03-17 10:44:32,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:44:32,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:32,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -238962832, now seen corresponding path program 1 times [2025-03-17 10:44:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349206116] [2025-03-17 10:44:32,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:32,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 10:44:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 10:44:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:32,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:32,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349206116] [2025-03-17 10:44:32,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349206116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:32,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:32,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530689761] [2025-03-17 10:44:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:32,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:32,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:32,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:32,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:32,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 149 [2025-03-17 10:44:32,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 209 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-03-17 10:44:32,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:32,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 149 [2025-03-17 10:44:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:35,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 77#L689-1true, 16#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:35,901 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,901 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,901 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,901 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 16#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:35,907 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,907 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,907 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,907 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 16#L691-2true, Black: 163#true, 145#true, 77#L689-1true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:35,935 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,935 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,936 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:35,936 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:44:36,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][284], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 77#L689-1true, 145#true, Black: 163#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:36,509 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,509 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,509 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,509 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][285], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:36,537 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,537 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,537 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,537 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][286], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 18#L689-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 77#L689-1true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:36,540 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,540 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,540 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:36,540 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2025-03-17 10:44:37,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][295], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 77#L689-1true, 16#L691-2true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 94#L689-1true, 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:37,605 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-03-17 10:44:37,605 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-17 10:44:37,605 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-17 10:44:37,605 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-17 10:44:37,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 99#L690-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 77#L689-1true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:37,655 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,655 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,655 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,655 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 99#L690-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:37,682 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,682 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,682 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:37,682 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][295], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 77#L689-1true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 94#L689-1true, 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:38,204 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,204 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,204 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,204 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][296], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, 99#L690-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:38,388 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,389 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,389 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,389 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][297], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 99#L690-1true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 77#L689-1true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:38,425 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,425 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,425 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,425 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-17 10:44:38,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][132], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 94#L689-1true, 147#true, 128#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 11#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:38,670 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,670 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,670 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:38,670 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-17 10:44:39,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 62#L691-2true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:39,603 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 16#L691-2true, 145#true, Black: 163#true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L691-2true, 173#true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:39,676 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,676 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,677 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,677 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 16#L691-2true, 62#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, 58#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:39,686 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:39,686 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:44:40,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 65#L692true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:40,215 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,215 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,215 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,215 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 62#L691-2true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,216 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,216 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,216 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,216 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 145#true, 16#L691-2true, Black: 163#true, 80#L692true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:40,284 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 163#true, 145#true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 97#L691-2true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,284 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,284 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 65#L692true, 136#L690true, 147#true, 168#true, 93#L698true, 58#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:40,293 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,293 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,293 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,293 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 62#L691-2true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 136#L690true, 147#true, 168#true, 93#L698true, 58#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,296 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,296 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,296 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,296 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:44:40,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 16#L691-2true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L691-2true, 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:40,410 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:44:40,410 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:44:40,410 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:44:40,410 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:44:40,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|, #race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][170], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), 8#L690true, Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 65#L692true, 147#true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,565 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,565 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,565 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,565 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L690-2-->L690: Formula: (= |v_#race~x~0_6| |v_thr1Thread1of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread1of4ForFork0_#t~nondet3#1=|v_thr1Thread1of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][172], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 163#true, 145#true, 80#L692true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 147#true, 21#L690true, 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,823 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,823 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,823 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,823 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L690-2-->L690: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~x~0_6|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~x~0=|v_#race~x~0_6|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~x~0][200], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 173#true, 65#L692true, 136#L690true, 147#true, 168#true, 93#L698true, 58#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,832 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,832 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,832 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,832 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 16#L691-2true, 145#true, 80#L692true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|)]) [2025-03-17 10:44:40,958 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 97#L691-2true, 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:40,958 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,958 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:40,959 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:44:41,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([547] L691-5-->L691-4: Formula: (= |v_#race~x~0_3| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_3|} AuxVars[] AssignedVars[#race~x~0][211], [Black: 160#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet2#1|), Black: 165#(= |thr1Thread1of4ForFork0_#t~nondet3#1| |#race~x~0|), 145#true, 80#L692true, 50#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 151#true, 149#true, Black: 170#(= |thr1Thread3of4ForFork0_#t~nondet2#1| |#race~x~0|), 147#true, 85#L691-4true, 175#(= |#race~x~0| 0), 168#true, 93#L698true, Black: 155#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~x~0|), 121#L692true]) [2025-03-17 10:44:41,325 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-17 10:44:41,326 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-17 10:44:41,326 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-17 10:44:41,326 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-17 10:44:42,145 INFO L124 PetriNetUnfolderBase]: 58260/134342 cut-off events. [2025-03-17 10:44:42,146 INFO L125 PetriNetUnfolderBase]: For 284608/289894 co-relation queries the response was YES. [2025-03-17 10:44:42,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378714 conditions, 134342 events. 58260/134342 cut-off events. For 284608/289894 co-relation queries the response was YES. Maximal size of possible extension queue 4639. Compared 1777818 event pairs, 12497 based on Foata normal form. 113/110767 useless extension candidates. Maximal degree in co-relation 378586. Up to 37476 conditions per place. [2025-03-17 10:44:43,599 INFO L140 encePairwiseOnDemand]: 129/149 looper letters, 113 selfloop transitions, 84 changer transitions 0/302 dead transitions. [2025-03-17 10:44:43,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 302 transitions, 2179 flow [2025-03-17 10:44:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-03-17 10:44:43,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389261744966443 [2025-03-17 10:44:43,601 INFO L175 Difference]: Start difference. First operand has 148 places, 209 transitions, 1058 flow. Second operand 3 states and 375 transitions. [2025-03-17 10:44:43,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 302 transitions, 2179 flow [2025-03-17 10:44:44,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 302 transitions, 2031 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:44:44,249 INFO L231 Difference]: Finished difference. Result has 150 places, 291 transitions, 2108 flow [2025-03-17 10:44:44,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=150, PETRI_TRANSITIONS=291} [2025-03-17 10:44:44,250 INFO L279 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2025-03-17 10:44:44,250 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 291 transitions, 2108 flow [2025-03-17 10:44:44,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-03-17 10:44:44,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:44,250 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:44:44,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:44:44,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-17 10:44:44,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1851149162, now seen corresponding path program 1 times [2025-03-17 10:44:44,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:44,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470027028] [2025-03-17 10:44:44,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:44,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:44,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:44:44,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:44:44,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:44,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:44,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:44:44,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:44:44,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:44,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:44,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:44,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-17 10:44:44,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-17 10:44:44,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-17 10:44:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:44:44,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 10:44:44,270 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:44,270 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 10:44:44,286 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 180 transitions, 400 flow [2025-03-17 10:44:44,298 INFO L124 PetriNetUnfolderBase]: 10/215 cut-off events. [2025-03-17 10:44:44,299 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 10:44:44,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 215 events. 10/215 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 732 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 190. Up to 6 conditions per place. [2025-03-17 10:44:44,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 180 transitions, 400 flow [2025-03-17 10:44:44,302 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 180 transitions, 400 flow [2025-03-17 10:44:44,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:44,302 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42fe0fdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:44,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 10:44:44,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:44,304 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-17 10:44:44,304 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 10:44:44,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:44,304 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] [2025-03-17 10:44:44,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 10:44:44,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash 215640015, now seen corresponding path program 1 times [2025-03-17 10:44:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182403879] [2025-03-17 10:44:44,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:44,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:44:44,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:44:44,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:44,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:44,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-03-17 10:44:44,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182403879] [2025-03-17 10:44:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182403879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:44,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:44,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:44,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812070813] [2025-03-17 10:44:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:44,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:44,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-03-17 10:44:44,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-03-17 10:44:44,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:44,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-03-17 10:44:44,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:54,284 INFO L124 PetriNetUnfolderBase]: 60315/134329 cut-off events. [2025-03-17 10:44:54,284 INFO L125 PetriNetUnfolderBase]: For 43154/43154 co-relation queries the response was YES. [2025-03-17 10:44:55,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231019 conditions, 134329 events. 60315/134329 cut-off events. For 43154/43154 co-relation queries the response was YES. Maximal size of possible extension queue 3603. Compared 1715744 event pairs, 45993 based on Foata normal form. 42581/159557 useless extension candidates. Maximal degree in co-relation 178176. Up to 69791 conditions per place. [2025-03-17 10:44:55,899 INFO L140 encePairwiseOnDemand]: 153/180 looper letters, 45 selfloop transitions, 15 changer transitions 0/182 dead transitions. [2025-03-17 10:44:55,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 182 transitions, 556 flow [2025-03-17 10:44:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-17 10:44:55,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8722222222222222 [2025-03-17 10:44:55,900 INFO L175 Difference]: Start difference. First operand has 181 places, 180 transitions, 400 flow. Second operand 3 states and 471 transitions. [2025-03-17 10:44:55,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 182 transitions, 556 flow [2025-03-17 10:44:55,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 182 transitions, 532 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:55,909 INFO L231 Difference]: Finished difference. Result has 171 places, 170 transitions, 458 flow [2025-03-17 10:44:55,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=171, PETRI_TRANSITIONS=170} [2025-03-17 10:44:55,910 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, -10 predicate places. [2025-03-17 10:44:55,910 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 170 transitions, 458 flow [2025-03-17 10:44:55,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-03-17 10:44:55,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:55,911 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-17 10:44:55,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:44:55,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 15 more)] === [2025-03-17 10:44:55,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2129364916, now seen corresponding path program 1 times [2025-03-17 10:44:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405431955] [2025-03-17 10:44:55,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:55,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:44:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:44:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:55,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-03-17 10:44:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405431955] [2025-03-17 10:44:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405431955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:44:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364194111] [2025-03-17 10:44:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:55,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:55,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-03-17 10:44:55,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 170 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-03-17 10:44:55,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:55,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-03-17 10:44:55,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand