./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --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/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:04,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:05,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:05,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:05,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:05,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:05,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:05,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:05,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:05,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:05,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:05,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:05,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:05,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:05,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:05,039 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-03-17 11:11:05,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:05,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:05,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:05,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:05,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:05,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-17 11:11:06,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045f3f220/9e9acab9285648838ef8c0d55af61e7c/FLAG0d36cae28 [2025-03-17 11:11:06,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:06,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-17 11:11:06,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045f3f220/9e9acab9285648838ef8c0d55af61e7c/FLAG0d36cae28 [2025-03-17 11:11:06,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045f3f220/9e9acab9285648838ef8c0d55af61e7c [2025-03-17 11:11:06,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:06,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:06,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:06,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:06,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:06,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:06" (1/1) ... [2025-03-17 11:11:06,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:06, skipping insertion in model container [2025-03-17 11:11:06,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:06" (1/1) ... [2025-03-17 11:11:06,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:07,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:07,154 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:07,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:07,207 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:07,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07 WrapperNode [2025-03-17 11:11:07,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:07,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:07,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:07,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:07,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,267 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 472 [2025-03-17 11:11:07,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:07,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:07,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:07,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:07,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:07,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:07,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:07,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:07,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (1/1) ... [2025-03-17 11:11:07,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:07,349 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 11:11:07,352 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 11:11:07,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:07,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:07,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:07,379 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 11:11:07,480 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:07,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:08,082 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:08,083 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:08,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:08,109 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:08,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:08 BoogieIcfgContainer [2025-03-17 11:11:08,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:08,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:08,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:08,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:08,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:06" (1/3) ... [2025-03-17 11:11:08,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35837e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:08, skipping insertion in model container [2025-03-17 11:11:08,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:07" (2/3) ... [2025-03-17 11:11:08,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35837e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:08, skipping insertion in model container [2025-03-17 11:11:08,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:08" (3/3) ... [2025-03-17 11:11:08,117 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-03-17 11:11:08,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:08,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 590 locations, 1 initial locations, 6 loop locations, and 57 error locations. [2025-03-17 11:11:08,130 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:08,277 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:08,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 619 transitions, 1259 flow [2025-03-17 11:11:08,501 INFO L124 PetriNetUnfolderBase]: 30/616 cut-off events. [2025-03-17 11:11:08,503 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:08,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 616 events. 30/616 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1512 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 464. Up to 3 conditions per place. [2025-03-17 11:11:08,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 619 transitions, 1259 flow [2025-03-17 11:11:08,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 595 transitions, 1208 flow [2025-03-17 11:11:08,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:08,545 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;@db0d5aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:08,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-17 11:11:08,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:08,550 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:11:08,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:08,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:08,551 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] [2025-03-17 11:11:08,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1982628274, now seen corresponding path program 1 times [2025-03-17 11:11:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361183517] [2025-03-17 11:11:08,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:11:08,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:11:08,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:08,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:08,712 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 11:11:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361183517] [2025-03-17 11:11:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361183517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:08,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063173577] [2025-03-17 11:11:08,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:08,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-03-17 11:11:08,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 595 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:08,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:08,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-03-17 11:11:08,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:09,070 INFO L124 PetriNetUnfolderBase]: 37/1035 cut-off events. [2025-03-17 11:11:09,070 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 11:11:09,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1035 events. 37/1035 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4641 event pairs, 12 based on Foata normal form. 31/907 useless extension candidates. Maximal degree in co-relation 832. Up to 39 conditions per place. [2025-03-17 11:11:09,087 INFO L140 encePairwiseOnDemand]: 601/619 looper letters, 14 selfloop transitions, 2 changer transitions 6/579 dead transitions. [2025-03-17 11:11:09,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 579 transitions, 1208 flow [2025-03-17 11:11:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-03-17 11:11:09,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-03-17 11:11:09,107 INFO L175 Difference]: Start difference. First operand has 577 places, 595 transitions, 1208 flow. Second operand 3 states and 1784 transitions. [2025-03-17 11:11:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 579 transitions, 1208 flow [2025-03-17 11:11:09,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:09,128 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1156 flow [2025-03-17 11:11:09,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2025-03-17 11:11:09,134 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-03-17 11:11:09,135 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1156 flow [2025-03-17 11:11:09,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:09,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:09,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:09,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:09,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -257551743, now seen corresponding path program 1 times [2025-03-17 11:11:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515305131] [2025-03-17 11:11:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:09,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:11:09,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:11:09,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:09,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:09,190 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 11:11:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515305131] [2025-03-17 11:11:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515305131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:09,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:09,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:09,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707456317] [2025-03-17 11:11:09,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:09,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:09,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:09,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:09,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-03-17 11:11:09,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:09,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:09,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-03-17 11:11:09,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:09,480 INFO L124 PetriNetUnfolderBase]: 57/1460 cut-off events. [2025-03-17 11:11:09,480 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:09,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1460 events. 57/1460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8165 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1496. Up to 51 conditions per place. [2025-03-17 11:11:09,503 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-03-17 11:11:09,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 572 transitions, 1186 flow [2025-03-17 11:11:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-03-17 11:11:09,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526117393645666 [2025-03-17 11:11:09,508 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1156 flow. Second operand 3 states and 1769 transitions. [2025-03-17 11:11:09,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 572 transitions, 1186 flow [2025-03-17 11:11:09,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:09,517 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1154 flow [2025-03-17 11:11:09,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2025-03-17 11:11:09,518 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -12 predicate places. [2025-03-17 11:11:09,518 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1154 flow [2025-03-17 11:11:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:09,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:09,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:09,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:09,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:09,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1415705075, now seen corresponding path program 1 times [2025-03-17 11:11:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:09,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456577577] [2025-03-17 11:11:09,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:09,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:11:09,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:11:09,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:09,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456577577] [2025-03-17 11:11:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456577577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887427022] [2025-03-17 11:11:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:09,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:09,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:09,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:09,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 619 [2025-03-17 11:11:09,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:09,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:09,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 619 [2025-03-17 11:11:09,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:09,811 INFO L124 PetriNetUnfolderBase]: 57/1447 cut-off events. [2025-03-17 11:11:09,811 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-03-17 11:11:09,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1447 events. 57/1447 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7731 event pairs, 20 based on Foata normal form. 0/1225 useless extension candidates. Maximal degree in co-relation 1467. Up to 51 conditions per place. [2025-03-17 11:11:09,825 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-03-17 11:11:09,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 571 transitions, 1184 flow [2025-03-17 11:11:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-03-17 11:11:09,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9526117393645666 [2025-03-17 11:11:09,829 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1154 flow. Second operand 3 states and 1769 transitions. [2025-03-17 11:11:09,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 571 transitions, 1184 flow [2025-03-17 11:11:09,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 571 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:09,835 INFO L231 Difference]: Finished difference. Result has 564 places, 571 transitions, 1152 flow [2025-03-17 11:11:09,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=564, PETRI_TRANSITIONS=571} [2025-03-17 11:11:09,836 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -13 predicate places. [2025-03-17 11:11:09,836 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 571 transitions, 1152 flow [2025-03-17 11:11:09,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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 11:11:09,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:09,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:09,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:09,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:09,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:09,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1944824722, now seen corresponding path program 1 times [2025-03-17 11:11:09,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:09,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867949199] [2025-03-17 11:11:09,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:09,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:11:09,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:11:09,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:09,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:09,877 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 11:11:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867949199] [2025-03-17 11:11:09,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867949199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:09,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:09,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951833270] [2025-03-17 11:11:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:09,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:09,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:09,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:09,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-03-17 11:11:09,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 571 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:09,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:09,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-03-17 11:11:09,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:10,165 INFO L124 PetriNetUnfolderBase]: 69/1462 cut-off events. [2025-03-17 11:11:10,165 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 11:11:10,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1462 events. 69/1462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8302 event pairs, 32 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1509. Up to 80 conditions per place. [2025-03-17 11:11:10,192 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2025-03-17 11:11:10,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 566 transitions, 1176 flow [2025-03-17 11:11:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-03-17 11:11:10,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-03-17 11:11:10,196 INFO L175 Difference]: Start difference. First operand has 564 places, 571 transitions, 1152 flow. Second operand 3 states and 1762 transitions. [2025-03-17 11:11:10,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 566 transitions, 1176 flow [2025-03-17 11:11:10,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 566 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:10,204 INFO L231 Difference]: Finished difference. Result has 559 places, 566 transitions, 1140 flow [2025-03-17 11:11:10,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=559, PETRI_TRANSITIONS=566} [2025-03-17 11:11:10,205 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2025-03-17 11:11:10,205 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 566 transitions, 1140 flow [2025-03-17 11:11:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:10,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:10,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:10,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:10,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:10,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -970896801, now seen corresponding path program 1 times [2025-03-17 11:11:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:10,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909440176] [2025-03-17 11:11:10,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:11:10,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:11:10,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:10,688 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 11:11:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909440176] [2025-03-17 11:11:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909440176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391483995] [2025-03-17 11:11:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:10,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:11,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 619 [2025-03-17 11:11:11,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 566 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 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 11:11:11,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:11,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 619 [2025-03-17 11:11:11,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:18,094 INFO L124 PetriNetUnfolderBase]: 12108/56241 cut-off events. [2025-03-17 11:11:18,094 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-03-17 11:11:18,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73722 conditions, 56241 events. 12108/56241 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 786230 event pairs, 10080 based on Foata normal form. 0/49040 useless extension candidates. Maximal degree in co-relation 73673. Up to 17156 conditions per place. [2025-03-17 11:11:18,515 INFO L140 encePairwiseOnDemand]: 601/619 looper letters, 78 selfloop transitions, 15 changer transitions 0/563 dead transitions. [2025-03-17 11:11:18,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 563 transitions, 1320 flow [2025-03-17 11:11:18,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3132 transitions. [2025-03-17 11:11:18,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8432956381260097 [2025-03-17 11:11:18,522 INFO L175 Difference]: Start difference. First operand has 559 places, 566 transitions, 1140 flow. Second operand 6 states and 3132 transitions. [2025-03-17 11:11:18,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 563 transitions, 1320 flow [2025-03-17 11:11:18,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1319 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:18,532 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1163 flow [2025-03-17 11:11:18,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2025-03-17 11:11:18,534 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2025-03-17 11:11:18,535 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1163 flow [2025-03-17 11:11:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 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 11:11:18,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:18,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:18,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:18,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1375908436, now seen corresponding path program 1 times [2025-03-17 11:11:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619927340] [2025-03-17 11:11:18,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:11:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:11:18,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:18,595 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 11:11:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619927340] [2025-03-17 11:11:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619927340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:18,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062772148] [2025-03-17 11:11:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:18,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:18,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-03-17 11:11:18,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:18,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-03-17 11:11:18,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:18,801 INFO L124 PetriNetUnfolderBase]: 37/1040 cut-off events. [2025-03-17 11:11:18,801 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-17 11:11:18,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1040 events. 37/1040 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4531 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1057. Up to 38 conditions per place. [2025-03-17 11:11:18,818 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-03-17 11:11:18,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1191 flow [2025-03-17 11:11:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-03-17 11:11:18,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-03-17 11:11:18,822 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1163 flow. Second operand 3 states and 1771 transitions. [2025-03-17 11:11:18,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1191 flow [2025-03-17 11:11:18,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:18,831 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1135 flow [2025-03-17 11:11:18,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2025-03-17 11:11:18,833 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -21 predicate places. [2025-03-17 11:11:18,833 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1135 flow [2025-03-17 11:11:18,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:18,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:18,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:18,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1344764201, now seen corresponding path program 1 times [2025-03-17 11:11:18,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-03-17 11:11:18,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:11:18,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:11:18,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:18,874 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 11:11:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271451812] [2025-03-17 11:11:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271451812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:18,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029081515] [2025-03-17 11:11:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:18,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:18,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:18,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-03-17 11:11:18,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:18,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-03-17 11:11:18,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:19,285 INFO L124 PetriNetUnfolderBase]: 137/2474 cut-off events. [2025-03-17 11:11:19,285 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:11:19,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 2474 events. 137/2474 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18326 event pairs, 64 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 2603. Up to 141 conditions per place. [2025-03-17 11:11:19,324 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2025-03-17 11:11:19,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 557 transitions, 1159 flow [2025-03-17 11:11:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-03-17 11:11:19,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-03-17 11:11:19,328 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1135 flow. Second operand 3 states and 1762 transitions. [2025-03-17 11:11:19,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 557 transitions, 1159 flow [2025-03-17 11:11:19,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:19,334 INFO L231 Difference]: Finished difference. Result has 551 places, 557 transitions, 1123 flow [2025-03-17 11:11:19,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2025-03-17 11:11:19,336 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2025-03-17 11:11:19,336 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1123 flow [2025-03-17 11:11:19,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:19,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:19,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:19,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:19,337 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:19,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1982207113, now seen corresponding path program 1 times [2025-03-17 11:11:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342119224] [2025-03-17 11:11:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:19,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:11:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:11:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:19,373 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 11:11:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342119224] [2025-03-17 11:11:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342119224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:19,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011782866] [2025-03-17 11:11:19,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:19,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:19,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:19,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:19,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-03-17 11:11:19,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:19,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:19,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-03-17 11:11:19,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:19,708 INFO L124 PetriNetUnfolderBase]: 63/1714 cut-off events. [2025-03-17 11:11:19,708 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-17 11:11:19,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 1714 events. 63/1714 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9441 event pairs, 20 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2025-03-17 11:11:19,726 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2025-03-17 11:11:19,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1151 flow [2025-03-17 11:11:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-03-17 11:11:19,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-03-17 11:11:19,731 INFO L175 Difference]: Start difference. First operand has 551 places, 557 transitions, 1123 flow. Second operand 3 states and 1771 transitions. [2025-03-17 11:11:19,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1151 flow [2025-03-17 11:11:19,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:19,736 INFO L231 Difference]: Finished difference. Result has 551 places, 556 transitions, 1124 flow [2025-03-17 11:11:19,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=551, PETRI_TRANSITIONS=556} [2025-03-17 11:11:19,739 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2025-03-17 11:11:19,739 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 556 transitions, 1124 flow [2025-03-17 11:11:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:19,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:19,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:19,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:19,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -320750575, now seen corresponding path program 1 times [2025-03-17 11:11:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033215113] [2025-03-17 11:11:19,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:19,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:11:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:11:19,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:19,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:19,789 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 11:11:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033215113] [2025-03-17 11:11:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033215113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:19,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700860837] [2025-03-17 11:11:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:19,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:19,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:19,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 619 [2025-03-17 11:11:19,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 556 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:19,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:19,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 619 [2025-03-17 11:11:19,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,091 INFO L124 PetriNetUnfolderBase]: 137/2434 cut-off events. [2025-03-17 11:11:20,091 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-03-17 11:11:20,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 2434 events. 137/2434 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17649 event pairs, 64 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 2540. Up to 141 conditions per place. [2025-03-17 11:11:20,131 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 16 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2025-03-17 11:11:20,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1148 flow [2025-03-17 11:11:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2025-03-17 11:11:20,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488422186322025 [2025-03-17 11:11:20,134 INFO L175 Difference]: Start difference. First operand has 551 places, 556 transitions, 1124 flow. Second operand 3 states and 1762 transitions. [2025-03-17 11:11:20,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1148 flow [2025-03-17 11:11:20,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:20,142 INFO L231 Difference]: Finished difference. Result has 546 places, 551 transitions, 1112 flow [2025-03-17 11:11:20,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2025-03-17 11:11:20,144 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-03-17 11:11:20,144 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1112 flow [2025-03-17 11:11:20,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 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 11:11:20,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:20,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:20,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:20,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash -276401577, now seen corresponding path program 1 times [2025-03-17 11:11:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088623249] [2025-03-17 11:11:20,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:11:20,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:11:20,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,192 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 11:11:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088623249] [2025-03-17 11:11:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088623249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927980885] [2025-03-17 11:11:20,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 619 [2025-03-17 11:11:20,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:20,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 619 [2025-03-17 11:11:20,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,313 INFO L124 PetriNetUnfolderBase]: 39/802 cut-off events. [2025-03-17 11:11:20,313 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-17 11:11:20,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 802 events. 39/802 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2972 event pairs, 20 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2025-03-17 11:11:20,325 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-17 11:11:20,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1140 flow [2025-03-17 11:11:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2025-03-17 11:11:20,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536887452880991 [2025-03-17 11:11:20,329 INFO L175 Difference]: Start difference. First operand has 546 places, 551 transitions, 1112 flow. Second operand 3 states and 1771 transitions. [2025-03-17 11:11:20,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1140 flow [2025-03-17 11:11:20,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:20,335 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1113 flow [2025-03-17 11:11:20,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2025-03-17 11:11:20,337 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-03-17 11:11:20,337 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1113 flow [2025-03-17 11:11:20,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 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 11:11:20,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:20,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:20,339 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:20,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1043034086, now seen corresponding path program 1 times [2025-03-17 11:11:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32463899] [2025-03-17 11:11:20,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:11:20,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:11:20,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,385 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 11:11:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32463899] [2025-03-17 11:11:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32463899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:20,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346362313] [2025-03-17 11:11:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:20,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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 11:11:20,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:20,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,499 INFO L124 PetriNetUnfolderBase]: 35/982 cut-off events. [2025-03-17 11:11:20,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:11:20,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 982 events. 35/982 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4302 event pairs, 6 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 986. Up to 23 conditions per place. [2025-03-17 11:11:20,511 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-17 11:11:20,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1145 flow [2025-03-17 11:11:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:20,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:20,514 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1113 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:20,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1145 flow [2025-03-17 11:11:20,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:20,520 INFO L231 Difference]: Finished difference. Result has 545 places, 549 transitions, 1111 flow [2025-03-17 11:11:20,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=545, PETRI_TRANSITIONS=549} [2025-03-17 11:11:20,521 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2025-03-17 11:11:20,521 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 549 transitions, 1111 flow [2025-03-17 11:11:20,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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 11:11:20,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:20,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:20,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1279925978, now seen corresponding path program 1 times [2025-03-17 11:11:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115023599] [2025-03-17 11:11:20,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:11:20,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:11:20,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:20,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115023599] [2025-03-17 11:11:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115023599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355576698] [2025-03-17 11:11:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:20,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 549 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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 11:11:20,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:20,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,688 INFO L124 PetriNetUnfolderBase]: 32/868 cut-off events. [2025-03-17 11:11:20,688 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-17 11:11:20,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 868 events. 32/868 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3372 event pairs, 6 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 867. Up to 23 conditions per place. [2025-03-17 11:11:20,700 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-17 11:11:20,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 550 transitions, 1143 flow [2025-03-17 11:11:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:20,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:20,704 INFO L175 Difference]: Start difference. First operand has 545 places, 549 transitions, 1111 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:20,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 550 transitions, 1143 flow [2025-03-17 11:11:20,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:20,711 INFO L231 Difference]: Finished difference. Result has 544 places, 548 transitions, 1109 flow [2025-03-17 11:11:20,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=544, PETRI_TRANSITIONS=548} [2025-03-17 11:11:20,714 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-03-17 11:11:20,714 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 548 transitions, 1109 flow [2025-03-17 11:11:20,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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 11:11:20,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:20,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:20,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:20,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 187725987, now seen corresponding path program 1 times [2025-03-17 11:11:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935287004] [2025-03-17 11:11:20,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:11:20,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:11:20,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,865 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 11:11:20,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935287004] [2025-03-17 11:11:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935287004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600845729] [2025-03-17 11:11:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-03-17 11:11:20,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 548 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 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 11:11:20,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-03-17 11:11:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,974 INFO L124 PetriNetUnfolderBase]: 41/983 cut-off events. [2025-03-17 11:11:20,974 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-03-17 11:11:20,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 983 events. 41/983 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4235 event pairs, 12 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1014. Up to 39 conditions per place. [2025-03-17 11:11:20,984 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2025-03-17 11:11:20,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 551 transitions, 1151 flow [2025-03-17 11:11:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:20,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:20,988 INFO L175 Difference]: Start difference. First operand has 544 places, 548 transitions, 1109 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 551 transitions, 1151 flow [2025-03-17 11:11:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:20,996 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1123 flow [2025-03-17 11:11:20,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2025-03-17 11:11:20,998 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-03-17 11:11:20,998 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1123 flow [2025-03-17 11:11:20,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 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 11:11:20,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:20,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash -657788496, now seen corresponding path program 1 times [2025-03-17 11:11:21,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719065363] [2025-03-17 11:11:21,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 11:11:21,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 11:11:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719065363] [2025-03-17 11:11:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719065363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453292730] [2025-03-17 11:11:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:21,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:21,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:21,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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 11:11:21,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:21,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:21,128 INFO L124 PetriNetUnfolderBase]: 29/758 cut-off events. [2025-03-17 11:11:21,128 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2025-03-17 11:11:21,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 758 events. 29/758 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2527 event pairs, 6 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2025-03-17 11:11:21,136 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-17 11:11:21,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1155 flow [2025-03-17 11:11:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:21,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:21,140 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1123 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1155 flow [2025-03-17 11:11:21,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 550 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:21,147 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1119 flow [2025-03-17 11:11:21,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2025-03-17 11:11:21,148 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2025-03-17 11:11:21,148 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1119 flow [2025-03-17 11:11:21,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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 11:11:21,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:21,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:21,150 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2104913941, now seen corresponding path program 1 times [2025-03-17 11:11:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420955806] [2025-03-17 11:11:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 11:11:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 11:11:21,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,196 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 11:11:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420955806] [2025-03-17 11:11:21,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420955806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011195864] [2025-03-17 11:11:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:21,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:21,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-03-17 11:11:21,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:21,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-03-17 11:11:21,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:21,389 INFO L124 PetriNetUnfolderBase]: 86/1557 cut-off events. [2025-03-17 11:11:21,389 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-17 11:11:21,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 1557 events. 86/1557 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9076 event pairs, 12 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 1658. Up to 99 conditions per place. [2025-03-17 11:11:21,412 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 20 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-03-17 11:11:21,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 551 transitions, 1174 flow [2025-03-17 11:11:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2025-03-17 11:11:21,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558427571351642 [2025-03-17 11:11:21,415 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1119 flow. Second operand 3 states and 1775 transitions. [2025-03-17 11:11:21,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 551 transitions, 1174 flow [2025-03-17 11:11:21,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 551 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:21,420 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1121 flow [2025-03-17 11:11:21,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2025-03-17 11:11:21,422 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -35 predicate places. [2025-03-17 11:11:21,422 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1121 flow [2025-03-17 11:11:21,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:21,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:21,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:21,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:11:21,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:21,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1831935198, now seen corresponding path program 1 times [2025-03-17 11:11:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-03-17 11:11:21,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:11:21,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:11:21,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,466 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 11:11:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-03-17 11:11:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235247854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339100865] [2025-03-17 11:11:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:21,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:21,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-03-17 11:11:21,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 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 11:11:21,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-03-17 11:11:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:21,619 INFO L124 PetriNetUnfolderBase]: 65/1229 cut-off events. [2025-03-17 11:11:21,619 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2025-03-17 11:11:21,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1229 events. 65/1229 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6350 event pairs, 18 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 1298. Up to 57 conditions per place. [2025-03-17 11:11:21,639 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2025-03-17 11:11:21,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 549 transitions, 1163 flow [2025-03-17 11:11:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:21,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:21,643 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1121 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:21,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 549 transitions, 1163 flow [2025-03-17 11:11:21,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 549 transitions, 1163 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:21,648 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1139 flow [2025-03-17 11:11:21,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2025-03-17 11:11:21,649 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2025-03-17 11:11:21,650 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1139 flow [2025-03-17 11:11:21,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 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 11:11:21,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:21,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:21,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:21,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1719451831, now seen corresponding path program 1 times [2025-03-17 11:11:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263123361] [2025-03-17 11:11:21,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:11:21,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:11:21,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,699 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 11:11:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263123361] [2025-03-17 11:11:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263123361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769932560] [2025-03-17 11:11:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:21,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:21,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-03-17 11:11:21,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:21,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-03-17 11:11:21,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:22,026 INFO L124 PetriNetUnfolderBase]: 157/2691 cut-off events. [2025-03-17 11:11:22,026 INFO L125 PetriNetUnfolderBase]: For 27/41 co-relation queries the response was YES. [2025-03-17 11:11:22,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 2691 events. 157/2691 cut-off events. For 27/41 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19585 event pairs, 31 based on Foata normal form. 1/2408 useless extension candidates. Maximal degree in co-relation 2975. Up to 161 conditions per place. [2025-03-17 11:11:22,066 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 20 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2025-03-17 11:11:22,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 550 transitions, 1194 flow [2025-03-17 11:11:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2025-03-17 11:11:22,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558427571351642 [2025-03-17 11:11:22,070 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1139 flow. Second operand 3 states and 1775 transitions. [2025-03-17 11:11:22,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 550 transitions, 1194 flow [2025-03-17 11:11:22,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 550 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:22,077 INFO L231 Difference]: Finished difference. Result has 543 places, 545 transitions, 1139 flow [2025-03-17 11:11:22,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=543, PETRI_TRANSITIONS=545} [2025-03-17 11:11:22,078 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -34 predicate places. [2025-03-17 11:11:22,078 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 545 transitions, 1139 flow [2025-03-17 11:11:22,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:22,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:22,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:22,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:22,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:22,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1589098536, now seen corresponding path program 1 times [2025-03-17 11:11:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157065139] [2025-03-17 11:11:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:22,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:11:22,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:11:22,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:22,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:22,287 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 11:11:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157065139] [2025-03-17 11:11:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157065139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195918495] [2025-03-17 11:11:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:22,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:22,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:22,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:22,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:22,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 545 transitions, 1139 flow. Second operand has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 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 11:11:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:22,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:22,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:23,081 INFO L124 PetriNetUnfolderBase]: 124/1863 cut-off events. [2025-03-17 11:11:23,082 INFO L125 PetriNetUnfolderBase]: For 10/60 co-relation queries the response was YES. [2025-03-17 11:11:23,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1863 events. 124/1863 cut-off events. For 10/60 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11041 event pairs, 45 based on Foata normal form. 7/1718 useless extension candidates. Maximal degree in co-relation 2268. Up to 186 conditions per place. [2025-03-17 11:11:23,097 INFO L140 encePairwiseOnDemand]: 605/619 looper letters, 69 selfloop transitions, 15 changer transitions 0/583 dead transitions. [2025-03-17 11:11:23,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 583 transitions, 1399 flow [2025-03-17 11:11:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6211 transitions. [2025-03-17 11:11:23,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9121750624173888 [2025-03-17 11:11:23,105 INFO L175 Difference]: Start difference. First operand has 543 places, 545 transitions, 1139 flow. Second operand 11 states and 6211 transitions. [2025-03-17 11:11:23,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 583 transitions, 1399 flow [2025-03-17 11:11:23,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 583 transitions, 1399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:23,111 INFO L231 Difference]: Finished difference. Result has 558 places, 553 transitions, 1215 flow [2025-03-17 11:11:23,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1215, PETRI_PLACES=558, PETRI_TRANSITIONS=553} [2025-03-17 11:11:23,111 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2025-03-17 11:11:23,112 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 553 transitions, 1215 flow [2025-03-17 11:11:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 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 11:11:23,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:23,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:11:23,113 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 935969580, now seen corresponding path program 1 times [2025-03-17 11:11:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067547284] [2025-03-17 11:11:23,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:23,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:23,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 11:11:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 11:11:23,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:23,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:23,259 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 11:11:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067547284] [2025-03-17 11:11:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067547284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954225] [2025-03-17 11:11:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:23,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:23,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 553 transitions, 1215 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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 11:11:23,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:23,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:23,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,239 INFO L124 PetriNetUnfolderBase]: 276/3727 cut-off events. [2025-03-17 11:11:24,239 INFO L125 PetriNetUnfolderBase]: For 128/248 co-relation queries the response was YES. [2025-03-17 11:11:24,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3727 events. 276/3727 cut-off events. For 128/248 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 31452 event pairs, 98 based on Foata normal form. 8/3364 useless extension candidates. Maximal degree in co-relation 4519. Up to 314 conditions per place. [2025-03-17 11:11:24,290 INFO L140 encePairwiseOnDemand]: 605/619 looper letters, 65 selfloop transitions, 15 changer transitions 0/582 dead transitions. [2025-03-17 11:11:24,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 582 transitions, 1449 flow [2025-03-17 11:11:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6202 transitions. [2025-03-17 11:11:24,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910853282420326 [2025-03-17 11:11:24,296 INFO L175 Difference]: Start difference. First operand has 558 places, 553 transitions, 1215 flow. Second operand 11 states and 6202 transitions. [2025-03-17 11:11:24,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 582 transitions, 1449 flow [2025-03-17 11:11:24,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 582 transitions, 1445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:24,303 INFO L231 Difference]: Finished difference. Result has 572 places, 561 transitions, 1287 flow [2025-03-17 11:11:24,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1287, PETRI_PLACES=572, PETRI_TRANSITIONS=561} [2025-03-17 11:11:24,304 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-03-17 11:11:24,304 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 561 transitions, 1287 flow [2025-03-17 11:11:24,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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 11:11:24,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:24,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:24,305 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:24,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,305 INFO L85 PathProgramCache]: Analyzing trace with hash 936832642, now seen corresponding path program 1 times [2025-03-17 11:11:24,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008948184] [2025-03-17 11:11:24,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 11:11:24,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 11:11:24,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,341 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 11:11:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008948184] [2025-03-17 11:11:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008948184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:11:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856924001] [2025-03-17 11:11:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 619 [2025-03-17 11:11:24,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 561 transitions, 1287 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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 11:11:24,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 619 [2025-03-17 11:11:24,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,761 INFO L124 PetriNetUnfolderBase]: 355/3156 cut-off events. [2025-03-17 11:11:24,762 INFO L125 PetriNetUnfolderBase]: For 259/330 co-relation queries the response was YES. [2025-03-17 11:11:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 3156 events. 355/3156 cut-off events. For 259/330 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 25479 event pairs, 144 based on Foata normal form. 0/2796 useless extension candidates. Maximal degree in co-relation 3964. Up to 419 conditions per place. [2025-03-17 11:11:24,800 INFO L140 encePairwiseOnDemand]: 615/619 looper letters, 14 selfloop transitions, 3 changer transitions 0/564 dead transitions. [2025-03-17 11:11:24,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 564 transitions, 1329 flow [2025-03-17 11:11:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2025-03-17 11:11:24,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596122778675282 [2025-03-17 11:11:24,802 INFO L175 Difference]: Start difference. First operand has 572 places, 561 transitions, 1287 flow. Second operand 3 states and 1782 transitions. [2025-03-17 11:11:24,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 564 transitions, 1329 flow [2025-03-17 11:11:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 564 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:24,809 INFO L231 Difference]: Finished difference. Result has 575 places, 562 transitions, 1301 flow [2025-03-17 11:11:24,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1301, PETRI_PLACES=575, PETRI_TRANSITIONS=562} [2025-03-17 11:11:24,809 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -2 predicate places. [2025-03-17 11:11:24,809 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 562 transitions, 1301 flow [2025-03-17 11:11:24,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 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 11:11:24,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:24,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:24,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:24,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 334818786, now seen corresponding path program 1 times [2025-03-17 11:11:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382724016] [2025-03-17 11:11:24,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 11:11:24,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 11:11:24,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,951 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 11:11:24,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382724016] [2025-03-17 11:11:24,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382724016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863699442] [2025-03-17 11:11:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:24,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:24,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:25,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:25,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 562 transitions, 1301 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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 11:11:25,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:25,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:25,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:25,839 INFO L124 PetriNetUnfolderBase]: 296/3293 cut-off events. [2025-03-17 11:11:25,839 INFO L125 PetriNetUnfolderBase]: For 318/376 co-relation queries the response was YES. [2025-03-17 11:11:25,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 3293 events. 296/3293 cut-off events. For 318/376 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 25171 event pairs, 139 based on Foata normal form. 7/3002 useless extension candidates. Maximal degree in co-relation 4289. Up to 469 conditions per place. [2025-03-17 11:11:25,868 INFO L140 encePairwiseOnDemand]: 605/619 looper letters, 79 selfloop transitions, 15 changer transitions 0/600 dead transitions. [2025-03-17 11:11:25,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 600 transitions, 1615 flow [2025-03-17 11:11:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6211 transitions. [2025-03-17 11:11:25,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9121750624173888 [2025-03-17 11:11:25,874 INFO L175 Difference]: Start difference. First operand has 575 places, 562 transitions, 1301 flow. Second operand 11 states and 6211 transitions. [2025-03-17 11:11:25,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 600 transitions, 1615 flow [2025-03-17 11:11:25,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 600 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:25,881 INFO L231 Difference]: Finished difference. Result has 586 places, 565 transitions, 1350 flow [2025-03-17 11:11:25,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1350, PETRI_PLACES=586, PETRI_TRANSITIONS=565} [2025-03-17 11:11:25,882 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 9 predicate places. [2025-03-17 11:11:25,882 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 565 transitions, 1350 flow [2025-03-17 11:11:25,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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 11:11:25,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:25,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:11:25,883 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1863439067, now seen corresponding path program 1 times [2025-03-17 11:11:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-03-17 11:11:25,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:25,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 11:11:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 11:11:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-03-17 11:11:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339589195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443680249] [2025-03-17 11:11:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:26,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:26,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:26,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 565 transitions, 1350 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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 11:11:26,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:26,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,841 INFO L124 PetriNetUnfolderBase]: 162/2639 cut-off events. [2025-03-17 11:11:26,841 INFO L125 PetriNetUnfolderBase]: For 153/223 co-relation queries the response was YES. [2025-03-17 11:11:26,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 2639 events. 162/2639 cut-off events. For 153/223 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17585 event pairs, 65 based on Foata normal form. 3/2458 useless extension candidates. Maximal degree in co-relation 3513. Up to 234 conditions per place. [2025-03-17 11:11:26,870 INFO L140 encePairwiseOnDemand]: 604/619 looper letters, 71 selfloop transitions, 18 changer transitions 0/595 dead transitions. [2025-03-17 11:11:26,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 595 transitions, 1628 flow [2025-03-17 11:11:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:11:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:11:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6204 transitions. [2025-03-17 11:11:26,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9111470113085622 [2025-03-17 11:11:26,876 INFO L175 Difference]: Start difference. First operand has 586 places, 565 transitions, 1350 flow. Second operand 11 states and 6204 transitions. [2025-03-17 11:11:26,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 595 transitions, 1628 flow [2025-03-17 11:11:26,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 595 transitions, 1607 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:11:26,884 INFO L231 Difference]: Finished difference. Result has 592 places, 571 transitions, 1424 flow [2025-03-17 11:11:26,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1424, PETRI_PLACES=592, PETRI_TRANSITIONS=571} [2025-03-17 11:11:26,884 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 15 predicate places. [2025-03-17 11:11:26,884 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 571 transitions, 1424 flow [2025-03-17 11:11:26,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 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 11:11:26,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:26,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:26,885 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1528140829, now seen corresponding path program 1 times [2025-03-17 11:11:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869834005] [2025-03-17 11:11:26,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:11:26,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:11:26,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869834005] [2025-03-17 11:11:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869834005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857918114] [2025-03-17 11:11:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:27,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:27,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:27,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 571 transitions, 1424 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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 11:11:27,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:27,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,844 INFO L124 PetriNetUnfolderBase]: 311/3814 cut-off events. [2025-03-17 11:11:27,844 INFO L125 PetriNetUnfolderBase]: For 438/550 co-relation queries the response was YES. [2025-03-17 11:11:27,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 3814 events. 311/3814 cut-off events. For 438/550 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 31522 event pairs, 84 based on Foata normal form. 6/3535 useless extension candidates. Maximal degree in co-relation 5233. Up to 301 conditions per place. [2025-03-17 11:11:27,899 INFO L140 encePairwiseOnDemand]: 603/619 looper letters, 65 selfloop transitions, 22 changer transitions 0/599 dead transitions. [2025-03-17 11:11:27,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 599 transitions, 1696 flow [2025-03-17 11:11:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:11:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:11:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6755 transitions. [2025-03-17 11:11:27,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9093968766828218 [2025-03-17 11:11:27,905 INFO L175 Difference]: Start difference. First operand has 592 places, 571 transitions, 1424 flow. Second operand 12 states and 6755 transitions. [2025-03-17 11:11:27,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 599 transitions, 1696 flow [2025-03-17 11:11:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 599 transitions, 1675 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:11:27,918 INFO L231 Difference]: Finished difference. Result has 602 places, 583 transitions, 1535 flow [2025-03-17 11:11:27,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1535, PETRI_PLACES=602, PETRI_TRANSITIONS=583} [2025-03-17 11:11:27,919 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2025-03-17 11:11:27,919 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 583 transitions, 1535 flow [2025-03-17 11:11:27,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 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 11:11:27,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:27,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:27,921 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:27,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1817119845, now seen corresponding path program 1 times [2025-03-17 11:11:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597207314] [2025-03-17 11:11:27,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 11:11:27,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:11:27,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:11:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597207314] [2025-03-17 11:11:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597207314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:11:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019306424] [2025-03-17 11:11:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:11:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:11:28,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:11:28,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 619 [2025-03-17 11:11:28,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 583 transitions, 1535 flow. Second operand has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 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 11:11:28,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 619 [2025-03-17 11:11:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,897 INFO L124 PetriNetUnfolderBase]: 335/3800 cut-off events. [2025-03-17 11:11:28,897 INFO L125 PetriNetUnfolderBase]: For 658/698 co-relation queries the response was YES. [2025-03-17 11:11:28,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 3800 events. 335/3800 cut-off events. For 658/698 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 30560 event pairs, 104 based on Foata normal form. 0/3516 useless extension candidates. Maximal degree in co-relation 5320. Up to 370 conditions per place. [2025-03-17 11:11:28,936 INFO L140 encePairwiseOnDemand]: 603/619 looper letters, 65 selfloop transitions, 22 changer transitions 0/606 dead transitions. [2025-03-17 11:11:28,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 606 transitions, 1797 flow [2025-03-17 11:11:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:11:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 11:11:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6755 transitions. [2025-03-17 11:11:28,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9093968766828218 [2025-03-17 11:11:28,939 INFO L175 Difference]: Start difference. First operand has 602 places, 583 transitions, 1535 flow. Second operand 12 states and 6755 transitions. [2025-03-17 11:11:28,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 606 transitions, 1797 flow [2025-03-17 11:11:28,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 606 transitions, 1797 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:28,947 INFO L231 Difference]: Finished difference. Result has 617 places, 590 transitions, 1646 flow [2025-03-17 11:11:28,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1646, PETRI_PLACES=617, PETRI_TRANSITIONS=590} [2025-03-17 11:11:28,948 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 40 predicate places. [2025-03-17 11:11:28,948 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 590 transitions, 1646 flow [2025-03-17 11:11:28,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 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 11:11:28,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:28,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:28,949 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:28,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -109015002, now seen corresponding path program 1 times [2025-03-17 11:11:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-17 11:11:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-17 11:11:28,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-17 11:11:28,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-17 11:11:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276645903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059241389] [2025-03-17 11:11:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:29,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:29,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:29,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 590 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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 11:11:29,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:29,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,187 INFO L124 PetriNetUnfolderBase]: 183/3420 cut-off events. [2025-03-17 11:11:30,187 INFO L125 PetriNetUnfolderBase]: For 626/650 co-relation queries the response was YES. [2025-03-17 11:11:30,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 3420 events. 183/3420 cut-off events. For 626/650 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 24505 event pairs, 23 based on Foata normal form. 4/3236 useless extension candidates. Maximal degree in co-relation 4878. Up to 177 conditions per place. [2025-03-17 11:11:30,232 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 41 selfloop transitions, 5 changer transitions 0/599 dead transitions. [2025-03-17 11:11:30,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 599 transitions, 1767 flow [2025-03-17 11:11:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2025-03-17 11:11:30,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297253634894992 [2025-03-17 11:11:30,234 INFO L175 Difference]: Start difference. First operand has 617 places, 590 transitions, 1646 flow. Second operand 6 states and 3453 transitions. [2025-03-17 11:11:30,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 599 transitions, 1767 flow [2025-03-17 11:11:30,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 599 transitions, 1750 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:30,244 INFO L231 Difference]: Finished difference. Result has 614 places, 588 transitions, 1635 flow [2025-03-17 11:11:30,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1625, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1635, PETRI_PLACES=614, PETRI_TRANSITIONS=588} [2025-03-17 11:11:30,245 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 37 predicate places. [2025-03-17 11:11:30,245 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 588 transitions, 1635 flow [2025-03-17 11:11:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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 11:11:30,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:11:30,246 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:30,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1783415380, now seen corresponding path program 1 times [2025-03-17 11:11:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248007645] [2025-03-17 11:11:30,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 11:11:30,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 11:11:30,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248007645] [2025-03-17 11:11:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248007645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557849723] [2025-03-17 11:11:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:30,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:30,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 588 transitions, 1635 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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 11:11:30,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:30,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,625 INFO L124 PetriNetUnfolderBase]: 189/3708 cut-off events. [2025-03-17 11:11:31,625 INFO L125 PetriNetUnfolderBase]: For 760/820 co-relation queries the response was YES. [2025-03-17 11:11:31,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 3708 events. 189/3708 cut-off events. For 760/820 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27199 event pairs, 28 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 5171. Up to 195 conditions per place. [2025-03-17 11:11:31,680 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 40 selfloop transitions, 5 changer transitions 0/596 dead transitions. [2025-03-17 11:11:31,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 596 transitions, 1751 flow [2025-03-17 11:11:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2025-03-17 11:11:31,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929456112008616 [2025-03-17 11:11:31,683 INFO L175 Difference]: Start difference. First operand has 614 places, 588 transitions, 1635 flow. Second operand 6 states and 3452 transitions. [2025-03-17 11:11:31,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 596 transitions, 1751 flow [2025-03-17 11:11:31,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 596 transitions, 1741 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:31,693 INFO L231 Difference]: Finished difference. Result has 612 places, 586 transitions, 1631 flow [2025-03-17 11:11:31,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1621, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1631, PETRI_PLACES=612, PETRI_TRANSITIONS=586} [2025-03-17 11:11:31,694 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 35 predicate places. [2025-03-17 11:11:31,694 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 586 transitions, 1631 flow [2025-03-17 11:11:31,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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 11:11:31,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:31,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:31,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:11:31,695 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:31,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -170185619, now seen corresponding path program 1 times [2025-03-17 11:11:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352171021] [2025-03-17 11:11:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:31,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:31,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:31,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:31,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:31,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352171021] [2025-03-17 11:11:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352171021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424127691] [2025-03-17 11:11:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:31,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:31,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:31,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 619 [2025-03-17 11:11:31,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 586 transitions, 1631 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:31,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:31,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 619 [2025-03-17 11:11:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:32,689 INFO L124 PetriNetUnfolderBase]: 361/6114 cut-off events. [2025-03-17 11:11:32,689 INFO L125 PetriNetUnfolderBase]: For 637/662 co-relation queries the response was YES. [2025-03-17 11:11:32,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7869 conditions, 6114 events. 361/6114 cut-off events. For 637/662 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 53063 event pairs, 58 based on Foata normal form. 0/5669 useless extension candidates. Maximal degree in co-relation 7773. Up to 385 conditions per place. [2025-03-17 11:11:32,744 INFO L140 encePairwiseOnDemand]: 613/619 looper letters, 19 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2025-03-17 11:11:32,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 588 transitions, 1681 flow [2025-03-17 11:11:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2025-03-17 11:11:32,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553042541733979 [2025-03-17 11:11:32,746 INFO L175 Difference]: Start difference. First operand has 612 places, 586 transitions, 1631 flow. Second operand 3 states and 1774 transitions. [2025-03-17 11:11:32,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 588 transitions, 1681 flow [2025-03-17 11:11:32,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 588 transitions, 1671 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:32,756 INFO L231 Difference]: Finished difference. Result has 606 places, 584 transitions, 1627 flow [2025-03-17 11:11:32,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1627, PETRI_PLACES=606, PETRI_TRANSITIONS=584} [2025-03-17 11:11:32,757 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2025-03-17 11:11:32,757 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 584 transitions, 1627 flow [2025-03-17 11:11:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:32,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:32,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:11:32,758 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:32,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash 5957642, now seen corresponding path program 1 times [2025-03-17 11:11:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:32,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-17 11:11:32,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:32,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:11:32,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:11:32,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:32,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:11:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774728862] [2025-03-17 11:11:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774728862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321247875] [2025-03-17 11:11:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:33,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:33,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:33,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:33,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:33,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 584 transitions, 1627 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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 11:11:33,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:33,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:33,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:34,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1583] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 245#L107-17true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 829#true, Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 794#(<= ~n3~0 0), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 763#true, Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:34,252 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:34,252 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:34,252 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:34,252 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:34,286 INFO L124 PetriNetUnfolderBase]: 200/3858 cut-off events. [2025-03-17 11:11:34,286 INFO L125 PetriNetUnfolderBase]: For 623/640 co-relation queries the response was YES. [2025-03-17 11:11:34,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5464 conditions, 3858 events. 200/3858 cut-off events. For 623/640 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 28646 event pairs, 28 based on Foata normal form. 0/3664 useless extension candidates. Maximal degree in co-relation 5367. Up to 185 conditions per place. [2025-03-17 11:11:34,337 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 41 selfloop transitions, 5 changer transitions 0/593 dead transitions. [2025-03-17 11:11:34,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 593 transitions, 1748 flow [2025-03-17 11:11:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2025-03-17 11:11:34,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9297253634894992 [2025-03-17 11:11:34,340 INFO L175 Difference]: Start difference. First operand has 606 places, 584 transitions, 1627 flow. Second operand 6 states and 3453 transitions. [2025-03-17 11:11:34,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 593 transitions, 1748 flow [2025-03-17 11:11:34,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 593 transitions, 1748 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:34,352 INFO L231 Difference]: Finished difference. Result has 609 places, 582 transitions, 1633 flow [2025-03-17 11:11:34,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1623, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1633, PETRI_PLACES=609, PETRI_TRANSITIONS=582} [2025-03-17 11:11:34,353 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2025-03-17 11:11:34,353 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 582 transitions, 1633 flow [2025-03-17 11:11:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 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 11:11:34,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:34,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:34,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:11:34,354 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:34,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1130910672, now seen corresponding path program 1 times [2025-03-17 11:11:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-03-17 11:11:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:34,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-17 11:11:34,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-17 11:11:34,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:34,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-03-17 11:11:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251599529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:34,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648836518] [2025-03-17 11:11:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:34,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:35,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:35,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 582 transitions, 1633 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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 11:11:35,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:35,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][475], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 456#L79-16true, Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), 837#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 829#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:35,798 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-17 11:11:35,798 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-17 11:11:35,798 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-17 11:11:35,798 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:11:35,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][479], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 838#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 829#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), 238#L79-15true, Black: 825#true]) [2025-03-17 11:11:35,804 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-17 11:11:35,804 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-17 11:11:35,804 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-17 11:11:35,804 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-03-17 11:11:35,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][484], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 145#L79-14true, 839#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 829#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:35,809 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-03-17 11:11:35,809 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-17 11:11:35,809 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-17 11:11:35,809 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-17 11:11:35,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][488], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 829#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 500#L79-12true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:35,814 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-03-17 11:11:35,814 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-17 11:11:35,814 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-17 11:11:35,814 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-17 11:11:35,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][488], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 231#L79-13true, 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 829#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:35,818 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-17 11:11:35,818 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-17 11:11:35,818 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-17 11:11:35,818 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-17 11:11:35,989 INFO L124 PetriNetUnfolderBase]: 433/5029 cut-off events. [2025-03-17 11:11:35,989 INFO L125 PetriNetUnfolderBase]: For 1145/1184 co-relation queries the response was YES. [2025-03-17 11:11:36,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7316 conditions, 5029 events. 433/5029 cut-off events. For 1145/1184 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 43211 event pairs, 49 based on Foata normal form. 4/4726 useless extension candidates. Maximal degree in co-relation 7218. Up to 316 conditions per place. [2025-03-17 11:11:36,054 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 39 selfloop transitions, 5 changer transitions 0/589 dead transitions. [2025-03-17 11:11:36,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 589 transitions, 1744 flow [2025-03-17 11:11:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2025-03-17 11:11:36,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291868605277329 [2025-03-17 11:11:36,056 INFO L175 Difference]: Start difference. First operand has 609 places, 582 transitions, 1633 flow. Second operand 6 states and 3451 transitions. [2025-03-17 11:11:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 589 transitions, 1744 flow [2025-03-17 11:11:36,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 589 transitions, 1734 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:36,067 INFO L231 Difference]: Finished difference. Result has 607 places, 580 transitions, 1629 flow [2025-03-17 11:11:36,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1629, PETRI_PLACES=607, PETRI_TRANSITIONS=580} [2025-03-17 11:11:36,068 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 30 predicate places. [2025-03-17 11:11:36,068 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 580 transitions, 1629 flow [2025-03-17 11:11:36,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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 11:11:36,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:36,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:11:36,069 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:36,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1572755728, now seen corresponding path program 1 times [2025-03-17 11:11:36,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038265413] [2025-03-17 11:11:36,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 11:11:36,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 11:11:36,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:11:36,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038265413] [2025-03-17 11:11:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038265413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977065216] [2025-03-17 11:11:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:36,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:36,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:36,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 580 transitions, 1629 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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 11:11:36,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1583] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 245#L107-17true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 835#true, 841#true, 651#(= |#race~a1~0| 0), Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 794#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 763#true, Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:37,444 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:37,444 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:37,444 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:37,444 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:37,484 INFO L124 PetriNetUnfolderBase]: 204/4117 cut-off events. [2025-03-17 11:11:37,484 INFO L125 PetriNetUnfolderBase]: For 757/871 co-relation queries the response was YES. [2025-03-17 11:11:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 4117 events. 204/4117 cut-off events. For 757/871 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 32096 event pairs, 30 based on Foata normal form. 11/3924 useless extension candidates. Maximal degree in co-relation 5704. Up to 194 conditions per place. [2025-03-17 11:11:37,559 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 40 selfloop transitions, 5 changer transitions 0/588 dead transitions. [2025-03-17 11:11:37,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 588 transitions, 1745 flow [2025-03-17 11:11:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2025-03-17 11:11:37,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929456112008616 [2025-03-17 11:11:37,562 INFO L175 Difference]: Start difference. First operand has 607 places, 580 transitions, 1629 flow. Second operand 6 states and 3452 transitions. [2025-03-17 11:11:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 588 transitions, 1745 flow [2025-03-17 11:11:37,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 588 transitions, 1735 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:37,573 INFO L231 Difference]: Finished difference. Result has 605 places, 578 transitions, 1625 flow [2025-03-17 11:11:37,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1625, PETRI_PLACES=605, PETRI_TRANSITIONS=578} [2025-03-17 11:11:37,575 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 28 predicate places. [2025-03-17 11:11:37,575 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 578 transitions, 1625 flow [2025-03-17 11:11:37,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 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 11:11:37,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:37,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:11:37,576 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:37,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1925993458, now seen corresponding path program 1 times [2025-03-17 11:11:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403480780] [2025-03-17 11:11:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 11:11:37,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 11:11:37,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,608 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 11:11:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403480780] [2025-03-17 11:11:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403480780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975512763] [2025-03-17 11:11:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-03-17 11:11:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 578 transitions, 1625 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:37,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-03-17 11:11:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:38,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1583] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [Black: 692#(<= ~n2~0 0), 789#true, Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 245#L107-17true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 847#true, 651#(= |#race~a1~0| 0), 841#true, Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 794#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:38,141 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:38,141 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:38,141 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:38,141 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:38,196 INFO L124 PetriNetUnfolderBase]: 160/4200 cut-off events. [2025-03-17 11:11:38,197 INFO L125 PetriNetUnfolderBase]: For 652/676 co-relation queries the response was YES. [2025-03-17 11:11:38,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5745 conditions, 4200 events. 160/4200 cut-off events. For 652/676 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 30913 event pairs, 27 based on Foata normal form. 0/4030 useless extension candidates. Maximal degree in co-relation 5648. Up to 132 conditions per place. [2025-03-17 11:11:38,240 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 9 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2025-03-17 11:11:38,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 577 transitions, 1643 flow [2025-03-17 11:11:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-03-17 11:11:38,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-03-17 11:11:38,242 INFO L175 Difference]: Start difference. First operand has 605 places, 578 transitions, 1625 flow. Second operand 3 states and 1784 transitions. [2025-03-17 11:11:38,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 577 transitions, 1643 flow [2025-03-17 11:11:38,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 577 transitions, 1633 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:38,250 INFO L231 Difference]: Finished difference. Result has 601 places, 577 transitions, 1615 flow [2025-03-17 11:11:38,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1615, PETRI_PLACES=601, PETRI_TRANSITIONS=577} [2025-03-17 11:11:38,251 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 24 predicate places. [2025-03-17 11:11:38,252 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 577 transitions, 1615 flow [2025-03-17 11:11:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:38,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:38,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:38,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:11:38,253 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:38,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2046342324, now seen corresponding path program 1 times [2025-03-17 11:11:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355018629] [2025-03-17 11:11:38,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:38,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:38,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:11:38,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:11:38,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:38,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:38,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:38,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355018629] [2025-03-17 11:11:38,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355018629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:38,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:38,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:11:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135879479] [2025-03-17 11:11:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:38,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:11:38,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:38,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:11:38,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:11:38,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 619 [2025-03-17 11:11:38,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 577 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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 11:11:38,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:38,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 619 [2025-03-17 11:11:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:39,538 INFO L124 PetriNetUnfolderBase]: 270/4234 cut-off events. [2025-03-17 11:11:39,538 INFO L125 PetriNetUnfolderBase]: For 913/941 co-relation queries the response was YES. [2025-03-17 11:11:39,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6086 conditions, 4234 events. 270/4234 cut-off events. For 913/941 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33807 event pairs, 38 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 5988. Up to 214 conditions per place. [2025-03-17 11:11:39,583 INFO L140 encePairwiseOnDemand]: 612/619 looper letters, 39 selfloop transitions, 5 changer transitions 0/584 dead transitions. [2025-03-17 11:11:39,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 584 transitions, 1726 flow [2025-03-17 11:11:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:11:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:11:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2025-03-17 11:11:39,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291868605277329 [2025-03-17 11:11:39,585 INFO L175 Difference]: Start difference. First operand has 601 places, 577 transitions, 1615 flow. Second operand 6 states and 3451 transitions. [2025-03-17 11:11:39,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 584 transitions, 1726 flow [2025-03-17 11:11:39,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 584 transitions, 1725 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:39,594 INFO L231 Difference]: Finished difference. Result has 603 places, 575 transitions, 1620 flow [2025-03-17 11:11:39,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1620, PETRI_PLACES=603, PETRI_TRANSITIONS=575} [2025-03-17 11:11:39,595 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 26 predicate places. [2025-03-17 11:11:39,595 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 575 transitions, 1620 flow [2025-03-17 11:11:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 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 11:11:39,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:39,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:39,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:11:39,596 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1136641107, now seen corresponding path program 1 times [2025-03-17 11:11:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324676800] [2025-03-17 11:11:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 11:11:39,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 11:11:39,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:39,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:39,626 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 11:11:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324676800] [2025-03-17 11:11:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324676800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:39,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:39,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789669646] [2025-03-17 11:11:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:39,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:39,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-03-17 11:11:39,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 575 transitions, 1620 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:39,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:39,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-03-17 11:11:39,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:40,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1583] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][329], [Black: 692#(<= ~n2~0 0), 789#true, Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 245#L107-17true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 850#true, 651#(= |#race~a1~0| 0), Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, 660#(= |#race~a2~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 856#true, Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:40,112 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-17 11:11:40,112 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:40,112 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-17 11:11:40,112 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-17 11:11:40,169 INFO L124 PetriNetUnfolderBase]: 122/3730 cut-off events. [2025-03-17 11:11:40,169 INFO L125 PetriNetUnfolderBase]: For 540/607 co-relation queries the response was YES. [2025-03-17 11:11:40,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5104 conditions, 3730 events. 122/3730 cut-off events. For 540/607 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 27003 event pairs, 30 based on Foata normal form. 0/3613 useless extension candidates. Maximal degree in co-relation 5007. Up to 129 conditions per place. [2025-03-17 11:11:40,218 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 9 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2025-03-17 11:11:40,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 574 transitions, 1638 flow [2025-03-17 11:11:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-03-17 11:11:40,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606892837910609 [2025-03-17 11:11:40,220 INFO L175 Difference]: Start difference. First operand has 603 places, 575 transitions, 1620 flow. Second operand 3 states and 1784 transitions. [2025-03-17 11:11:40,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 574 transitions, 1638 flow [2025-03-17 11:11:40,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 574 transitions, 1628 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:11:40,228 INFO L231 Difference]: Finished difference. Result has 599 places, 574 transitions, 1610 flow [2025-03-17 11:11:40,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1610, PETRI_PLACES=599, PETRI_TRANSITIONS=574} [2025-03-17 11:11:40,229 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2025-03-17 11:11:40,229 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 574 transitions, 1610 flow [2025-03-17 11:11:40,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:40,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:40,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:11:40,229 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -83854453, now seen corresponding path program 1 times [2025-03-17 11:11:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153820332] [2025-03-17 11:11:40,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:40,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-17 11:11:40,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-17 11:11:40,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:40,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:40,257 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 11:11:40,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:40,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153820332] [2025-03-17 11:11:40,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153820332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:40,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470079366] [2025-03-17 11:11:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:40,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:40,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:40,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:40,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:40,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 619 [2025-03-17 11:11:40,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 574 transitions, 1610 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:40,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:40,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 619 [2025-03-17 11:11:40,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:40,792 INFO L124 PetriNetUnfolderBase]: 133/3239 cut-off events. [2025-03-17 11:11:40,792 INFO L125 PetriNetUnfolderBase]: For 445/484 co-relation queries the response was YES. [2025-03-17 11:11:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4409 conditions, 3239 events. 133/3239 cut-off events. For 445/484 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22354 event pairs, 39 based on Foata normal form. 30/3165 useless extension candidates. Maximal degree in co-relation 4312. Up to 154 conditions per place. [2025-03-17 11:11:40,831 INFO L140 encePairwiseOnDemand]: 617/619 looper letters, 7 selfloop transitions, 0 changer transitions 18/573 dead transitions. [2025-03-17 11:11:40,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 573 transitions, 1626 flow [2025-03-17 11:11:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-03-17 11:11:40,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601507808292946 [2025-03-17 11:11:40,833 INFO L175 Difference]: Start difference. First operand has 599 places, 574 transitions, 1610 flow. Second operand 3 states and 1783 transitions. [2025-03-17 11:11:40,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 573 transitions, 1626 flow [2025-03-17 11:11:40,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 573 transitions, 1625 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:40,843 INFO L231 Difference]: Finished difference. Result has 599 places, 555 transitions, 1514 flow [2025-03-17 11:11:40,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=599, PETRI_TRANSITIONS=555} [2025-03-17 11:11:40,843 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2025-03-17 11:11:40,844 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 555 transitions, 1514 flow [2025-03-17 11:11:40,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 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 11:11:40,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:40,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:11:40,844 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1799001322, now seen corresponding path program 1 times [2025-03-17 11:11:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412826614] [2025-03-17 11:11:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-17 11:11:40,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-17 11:11:40,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:40,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:11:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412826614] [2025-03-17 11:11:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412826614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:40,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:40,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837306842] [2025-03-17 11:11:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:40,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:40,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:40,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:40,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 555 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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 11:11:40,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:40,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:41,406 INFO L124 PetriNetUnfolderBase]: 155/3721 cut-off events. [2025-03-17 11:11:41,406 INFO L125 PetriNetUnfolderBase]: For 466/476 co-relation queries the response was YES. [2025-03-17 11:11:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 3721 events. 155/3721 cut-off events. For 466/476 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 24934 event pairs, 25 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5016. Up to 107 conditions per place. [2025-03-17 11:11:41,470 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 10 selfloop transitions, 2 changer transitions 14/556 dead transitions. [2025-03-17 11:11:41,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 556 transitions, 1542 flow [2025-03-17 11:11:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-03-17 11:11:41,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-03-17 11:11:41,471 INFO L175 Difference]: Start difference. First operand has 599 places, 555 transitions, 1514 flow. Second operand 3 states and 1780 transitions. [2025-03-17 11:11:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 556 transitions, 1542 flow [2025-03-17 11:11:41,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 556 transitions, 1534 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:41,482 INFO L231 Difference]: Finished difference. Result has 586 places, 540 transitions, 1414 flow [2025-03-17 11:11:41,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1414, PETRI_PLACES=586, PETRI_TRANSITIONS=540} [2025-03-17 11:11:41,483 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 9 predicate places. [2025-03-17 11:11:41,483 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 540 transitions, 1414 flow [2025-03-17 11:11:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 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 11:11:41,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:41,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:11:41,483 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:41,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2121801725, now seen corresponding path program 1 times [2025-03-17 11:11:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85202115] [2025-03-17 11:11:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-17 11:11:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-17 11:11:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:11:41,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:41,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85202115] [2025-03-17 11:11:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85202115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912051372] [2025-03-17 11:11:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:41,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:41,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:41,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:41,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:41,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:41,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 540 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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 11:11:41,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:41,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:41,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:41,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1273] L51-13-->L51-11: Formula: (= |v_#race~a2~0_6| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_6|} AuxVars[] AssignedVars[#race~a2~0][353], [Black: 692#(<= ~n2~0 0), 789#true, Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), 865#true, Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), 489#L79-19true, Black: 658#true, 862#true, 318#L51-11true, 48#L65-19true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 794#(<= ~n3~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 660#(= |#race~a2~0| 0), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 28#L102-1true, Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:41,937 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-17 11:11:41,937 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:41,937 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:41,937 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-17 11:11:41,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1584] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [Black: 692#(<= ~n2~0 0), 789#true, Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 649#true, Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 782#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 768#(<= ~n3~0 0), 865#true, 489#L79-19true, Black: 769#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 862#true, 444#L105true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), Black: 808#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 631#(= |#race~n3~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 794#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 795#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), 763#true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), Black: 825#true]) [2025-03-17 11:11:41,968 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-03-17 11:11:41,968 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-17 11:11:41,968 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-17 11:11:41,968 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-17 11:11:41,973 INFO L124 PetriNetUnfolderBase]: 139/2925 cut-off events. [2025-03-17 11:11:41,973 INFO L125 PetriNetUnfolderBase]: For 298/321 co-relation queries the response was YES. [2025-03-17 11:11:42,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2925 events. 139/2925 cut-off events. For 298/321 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 18698 event pairs, 27 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 3825. Up to 90 conditions per place. [2025-03-17 11:11:42,006 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 10 selfloop transitions, 2 changer transitions 10/541 dead transitions. [2025-03-17 11:11:42,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 541 transitions, 1442 flow [2025-03-17 11:11:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-03-17 11:11:42,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-03-17 11:11:42,008 INFO L175 Difference]: Start difference. First operand has 586 places, 540 transitions, 1414 flow. Second operand 3 states and 1780 transitions. [2025-03-17 11:11:42,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 541 transitions, 1442 flow [2025-03-17 11:11:42,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 541 transitions, 1380 flow, removed 9 selfloop flow, removed 17 redundant places. [2025-03-17 11:11:42,015 INFO L231 Difference]: Finished difference. Result has 563 places, 529 transitions, 1289 flow [2025-03-17 11:11:42,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1289, PETRI_PLACES=563, PETRI_TRANSITIONS=529} [2025-03-17 11:11:42,016 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2025-03-17 11:11:42,016 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 529 transitions, 1289 flow [2025-03-17 11:11:42,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 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 11:11:42,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:42,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:11:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:11:42,017 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2025-03-17 11:11:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1838083310, now seen corresponding path program 1 times [2025-03-17 11:11:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584820545] [2025-03-17 11:11:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 11:11:42,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 11:11:42,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:42,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:11:42,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:42,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584820545] [2025-03-17 11:11:42,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584820545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:42,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:42,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586909754] [2025-03-17 11:11:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:42,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:42,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:42,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 619 [2025-03-17 11:11:42,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 529 transitions, 1289 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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 11:11:42,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:42,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 619 [2025-03-17 11:11:42,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:42,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1273] L51-13-->L51-11: Formula: (= |v_#race~a2~0_6| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_6|} AuxVars[] AssignedVars[#race~a2~0][326], [789#true, Black: 692#(<= ~n2~0 0), Black: 693#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 698#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 700#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 706#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 714#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 774#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 655#(not |thread2Thread1of1ForFork1_#t~short11#1|), 865#true, 489#L79-19true, Black: 658#true, 48#L65-19true, 318#L51-11true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 736#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 722#(<= ~n1~0 0), 651#(= |#race~a1~0| 0), 631#(= |#race~n3~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 681#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), 763#true, 660#(= |#race~a2~0| 0), Black: 668#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 827#(= |#race~a3~0| 0), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 28#L102-1true, Black: 759#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 746#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), Black: 745#(<= ~n2~0 0), 868#true, Black: 825#true]) [2025-03-17 11:11:42,319 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-17 11:11:42,319 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:42,319 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-17 11:11:42,320 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:11:42,337 INFO L124 PetriNetUnfolderBase]: 121/1832 cut-off events. [2025-03-17 11:11:42,338 INFO L125 PetriNetUnfolderBase]: For 121/138 co-relation queries the response was YES. [2025-03-17 11:11:42,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1832 events. 121/1832 cut-off events. For 121/138 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10575 event pairs, 24 based on Foata normal form. 0/1769 useless extension candidates. Maximal degree in co-relation 2324. Up to 83 conditions per place. [2025-03-17 11:11:42,363 INFO L140 encePairwiseOnDemand]: 616/619 looper letters, 0 selfloop transitions, 0 changer transitions 530/530 dead transitions. [2025-03-17 11:11:42,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 530 transitions, 1317 flow [2025-03-17 11:11:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2025-03-17 11:11:42,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585352719439957 [2025-03-17 11:11:42,365 INFO L175 Difference]: Start difference. First operand has 563 places, 529 transitions, 1289 flow. Second operand 3 states and 1780 transitions. [2025-03-17 11:11:42,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 530 transitions, 1317 flow [2025-03-17 11:11:42,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 530 transitions, 1277 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-03-17 11:11:42,370 INFO L231 Difference]: Finished difference. Result has 544 places, 0 transitions, 0 flow [2025-03-17 11:11:42,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=619, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=544, PETRI_TRANSITIONS=0} [2025-03-17 11:11:42,371 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-03-17 11:11:42,371 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 0 transitions, 0 flow [2025-03-17 11:11:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2025-03-17 11:11:42,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2025-03-17 11:11:42,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2025-03-17 11:11:42,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2025-03-17 11:11:42,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2025-03-17 11:11:42,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2025-03-17 11:11:42,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2025-03-17 11:11:42,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2025-03-17 11:11:42,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2025-03-17 11:11:42,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2025-03-17 11:11:42,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2025-03-17 11:11:42,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2025-03-17 11:11:42,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:11:42,383 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:42,391 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:42,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:42,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:42 BasicIcfg [2025-03-17 11:11:42,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:42,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:42,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:42,397 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:42,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:08" (3/4) ... [2025-03-17 11:11:42,400 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:42,402 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:42,402 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:42,403 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:11:42,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-17 11:11:42,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:42,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:11:42,410 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:42,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:42,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:42,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:42,486 INFO L158 Benchmark]: Toolchain (without parser) took 35511.89ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 123.2MB in the beginning and 926.3MB in the end (delta: -803.1MB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,487 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:42,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 109.1MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.50ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 105.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,490 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 102.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:42,490 INFO L158 Benchmark]: IcfgBuilder took 792.95ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 57.7MB in the end (delta: 44.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,490 INFO L158 Benchmark]: TraceAbstraction took 34285.55ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 56.8MB in the beginning and 934.7MB in the end (delta: -877.9MB). Peak memory consumption was 403.2MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,490 INFO L158 Benchmark]: Witness Printer took 88.34ms. Allocated memory is still 1.5GB. Free memory was 934.7MB in the beginning and 926.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:42,491 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 109.1MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.50ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 105.3MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 102.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 792.95ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 57.7MB in the end (delta: 44.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34285.55ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 56.8MB in the beginning and 934.7MB in the end (delta: -877.9MB). Peak memory consumption was 403.2MB. Max. memory is 16.1GB. * Witness Printer took 88.34ms. Allocated memory is still 1.5GB. Free memory was 934.7MB in the beginning and 926.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 923 locations, 970 edges, 102 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.1s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6703 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4248 mSDsluCounter, 7189 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6221 mSDsCounter, 1285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10416 IncrementalHoareTripleChecker+Invalid, 11701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1285 mSolverCounterUnsat, 968 mSDtfsCounter, 10416 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1646occurred in iteration=24, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6252 ConstructedInterpolants, 0 QuantifiedInterpolants, 8576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:42,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE