./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:35,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:35,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:35,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:35,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:35,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:35,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:35,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:35,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:35,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:35,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:35,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:35,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:35,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:35,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:35,448 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-jdk21/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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2025-02-08 05:37:35,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:35,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:35,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:35,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:35,679 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:35,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-02-08 05:37:36,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22de5c15f/e0f81d318ae84c07808678db89771ade/FLAG13a05466a [2025-02-08 05:37:37,005 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:37,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-02-08 05:37:37,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22de5c15f/e0f81d318ae84c07808678db89771ade/FLAG13a05466a [2025-02-08 05:37:37,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22de5c15f/e0f81d318ae84c07808678db89771ade [2025-02-08 05:37:37,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:37,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:37,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:37,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:37,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:37,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37, skipping insertion in model container [2025-02-08 05:37:37,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:37,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:37,201 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:37,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:37,238 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:37,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37 WrapperNode [2025-02-08 05:37:37,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:37,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:37,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:37,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:37,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,281 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2025-02-08 05:37:37,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:37,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:37,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:37,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:37,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:37,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:37,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:37,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:37,320 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (1/1) ... [2025-02-08 05:37:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:37,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:37,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:37,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:37,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:37,374 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:37,450 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:37,451 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:37,788 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:37,788 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:37,800 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:37,801 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:37,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:37 BoogieIcfgContainer [2025-02-08 05:37:37,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:37,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:37,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:37,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:37,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:37" (1/3) ... [2025-02-08 05:37:37,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509071b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:37, skipping insertion in model container [2025-02-08 05:37:37,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:37" (2/3) ... [2025-02-08 05:37:37,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5509071b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:37, skipping insertion in model container [2025-02-08 05:37:37,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:37" (3/3) ... [2025-02-08 05:37:37,808 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2025-02-08 05:37:37,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:37,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-trans.wvr.c that has 4 procedures, 428 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2025-02-08 05:37:37,820 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:37,912 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:37,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 445 transitions, 911 flow [2025-02-08 05:37:38,142 INFO L124 PetriNetUnfolderBase]: 18/442 cut-off events. [2025-02-08 05:37:38,144 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:38,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 18/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 809 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2025-02-08 05:37:38,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 445 transitions, 911 flow [2025-02-08 05:37:38,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 421 transitions, 860 flow [2025-02-08 05:37:38,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:38,190 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;@13be1d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:38,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:37:38,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:38,200 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:37:38,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:38,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,202 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] [2025-02-08 05:37:38,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1153989640, now seen corresponding path program 1 times [2025-02-08 05:37:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690306580] [2025-02-08 05:37:38,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:37:38,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:37:38,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690306580] [2025-02-08 05:37:38,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690306580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524469401] [2025-02-08 05:37:38,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-02-08 05:37:38,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:38,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-02-08 05:37:38,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,564 INFO L124 PetriNetUnfolderBase]: 20/802 cut-off events. [2025-02-08 05:37:38,564 INFO L125 PetriNetUnfolderBase]: For 26/30 co-relation queries the response was YES. [2025-02-08 05:37:38,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 802 events. 20/802 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2905 event pairs, 12 based on Foata normal form. 75/765 useless extension candidates. Maximal degree in co-relation 704. Up to 38 conditions per place. [2025-02-08 05:37:38,579 INFO L140 encePairwiseOnDemand]: 430/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-02-08 05:37:38,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 408 transitions, 864 flow [2025-02-08 05:37:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-02-08 05:37:38,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-02-08 05:37:38,597 INFO L175 Difference]: Start difference. First operand has 415 places, 421 transitions, 860 flow. Second operand 3 states and 1270 transitions. [2025-02-08 05:37:38,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 408 transitions, 864 flow [2025-02-08 05:37:38,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 408 transitions, 852 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:38,609 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 826 flow [2025-02-08 05:37:38,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2025-02-08 05:37:38,614 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -5 predicate places. [2025-02-08 05:37:38,616 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 826 flow [2025-02-08 05:37:38,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:38,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,617 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] [2025-02-08 05:37:38,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:38,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1310705481, now seen corresponding path program 1 times [2025-02-08 05:37:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-02-08 05:37:38,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:37:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:37:38,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472965487] [2025-02-08 05:37:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472965487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230440775] [2025-02-08 05:37:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:38,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:38,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:38,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,843 INFO L124 PetriNetUnfolderBase]: 12/681 cut-off events. [2025-02-08 05:37:38,844 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 681 events. 12/681 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2579 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 677. Up to 22 conditions per place. [2025-02-08 05:37:38,854 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2025-02-08 05:37:38,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 407 transitions, 850 flow [2025-02-08 05:37:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:38,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:38,859 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 826 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:38,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 407 transitions, 850 flow [2025-02-08 05:37:38,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 407 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:38,865 INFO L231 Difference]: Finished difference. Result has 409 places, 407 transitions, 824 flow [2025-02-08 05:37:38,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=409, PETRI_TRANSITIONS=407} [2025-02-08 05:37:38,866 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -6 predicate places. [2025-02-08 05:37:38,866 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 407 transitions, 824 flow [2025-02-08 05:37:38,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:38,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,867 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] [2025-02-08 05:37:38,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:38,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -872251270, now seen corresponding path program 1 times [2025-02-08 05:37:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992301768] [2025-02-08 05:37:38,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:37:38,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:37:38,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992301768] [2025-02-08 05:37:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992301768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704456212] [2025-02-08 05:37:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:38,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:38,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:38,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,052 INFO L124 PetriNetUnfolderBase]: 12/671 cut-off events. [2025-02-08 05:37:39,053 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:39,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 671 events. 12/671 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2514 event pairs, 5 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2025-02-08 05:37:39,060 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2025-02-08 05:37:39,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 406 transitions, 848 flow [2025-02-08 05:37:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:39,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:39,063 INFO L175 Difference]: Start difference. First operand has 409 places, 407 transitions, 824 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:39,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 406 transitions, 848 flow [2025-02-08 05:37:39,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 406 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,069 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 822 flow [2025-02-08 05:37:39,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2025-02-08 05:37:39,070 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -7 predicate places. [2025-02-08 05:37:39,070 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 822 flow [2025-02-08 05:37:39,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:39,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:39,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1001415491, now seen corresponding path program 1 times [2025-02-08 05:37:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814040905] [2025-02-08 05:37:39,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:37:39,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:37:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814040905] [2025-02-08 05:37:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814040905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603906873] [2025-02-08 05:37:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-02-08 05:37:39,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:39,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-02-08 05:37:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,348 INFO L124 PetriNetUnfolderBase]: 34/1363 cut-off events. [2025-02-08 05:37:39,348 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:39,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1363 events. 34/1363 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6118 event pairs, 20 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1379. Up to 50 conditions per place. [2025-02-08 05:37:39,366 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2025-02-08 05:37:39,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 405 transitions, 850 flow [2025-02-08 05:37:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-02-08 05:37:39,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2025-02-08 05:37:39,369 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 822 flow. Second operand 3 states and 1258 transitions. [2025-02-08 05:37:39,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 405 transitions, 850 flow [2025-02-08 05:37:39,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 405 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,376 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 820 flow [2025-02-08 05:37:39,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-02-08 05:37:39,377 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -8 predicate places. [2025-02-08 05:37:39,377 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 820 flow [2025-02-08 05:37:39,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:39,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,378 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] [2025-02-08 05:37:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:39,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash -510863086, now seen corresponding path program 1 times [2025-02-08 05:37:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549712996] [2025-02-08 05:37:39,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:37:39,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:37:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549712996] [2025-02-08 05:37:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549712996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876247254] [2025-02-08 05:37:39,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:39,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:39,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,556 INFO L124 PetriNetUnfolderBase]: 16/867 cut-off events. [2025-02-08 05:37:39,556 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-08 05:37:39,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 867 events. 16/867 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3232 event pairs, 7 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 844. Up to 25 conditions per place. [2025-02-08 05:37:39,566 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-02-08 05:37:39,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 844 flow [2025-02-08 05:37:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:39,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:39,569 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 820 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:39,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 844 flow [2025-02-08 05:37:39,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 404 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,573 INFO L231 Difference]: Finished difference. Result has 406 places, 404 transitions, 818 flow [2025-02-08 05:37:39,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=406, PETRI_TRANSITIONS=404} [2025-02-08 05:37:39,574 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2025-02-08 05:37:39,574 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 404 transitions, 818 flow [2025-02-08 05:37:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,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] [2025-02-08 05:37:39,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:39,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1816800559, now seen corresponding path program 1 times [2025-02-08 05:37:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700190395] [2025-02-08 05:37:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:37:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:37:39,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,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-02-08 05:37:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700190395] [2025-02-08 05:37:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700190395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669535316] [2025-02-08 05:37:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:39,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:39,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,719 INFO L124 PetriNetUnfolderBase]: 16/857 cut-off events. [2025-02-08 05:37:39,720 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-08 05:37:39,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 857 events. 16/857 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3169 event pairs, 7 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-02-08 05:37:39,730 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2025-02-08 05:37:39,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 403 transitions, 842 flow [2025-02-08 05:37:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:39,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:39,732 INFO L175 Difference]: Start difference. First operand has 406 places, 404 transitions, 818 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:39,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 403 transitions, 842 flow [2025-02-08 05:37:39,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,737 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 816 flow [2025-02-08 05:37:39,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2025-02-08 05:37:39,738 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-02-08 05:37:39,738 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 816 flow [2025-02-08 05:37:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,739 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] [2025-02-08 05:37:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:39,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 425846379, now seen corresponding path program 1 times [2025-02-08 05:37:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378640067] [2025-02-08 05:37:39,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:37:39,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:37:39,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378640067] [2025-02-08 05:37:39,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378640067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250863637] [2025-02-08 05:37:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-02-08 05:37:39,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:39,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-02-08 05:37:39,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,889 INFO L124 PetriNetUnfolderBase]: 27/638 cut-off events. [2025-02-08 05:37:39,889 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2025-02-08 05:37:39,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 638 events. 27/638 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2311 event pairs, 20 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 622. Up to 50 conditions per place. [2025-02-08 05:37:39,897 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:39,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 402 transitions, 844 flow [2025-02-08 05:37:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-02-08 05:37:39,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2025-02-08 05:37:39,900 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 816 flow. Second operand 3 states and 1258 transitions. [2025-02-08 05:37:39,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 402 transitions, 844 flow [2025-02-08 05:37:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,905 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 814 flow [2025-02-08 05:37:39,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2025-02-08 05:37:39,906 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-02-08 05:37:39,906 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 814 flow [2025-02-08 05:37:39,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 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-02-08 05:37:39,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:37:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:39,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash -647855398, now seen corresponding path program 1 times [2025-02-08 05:37:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-02-08 05:37:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 05:37:39,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 05:37:39,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084295654] [2025-02-08 05:37:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084295654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26171874] [2025-02-08 05:37:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:39,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:39,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:39,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,032 INFO L124 PetriNetUnfolderBase]: 15/673 cut-off events. [2025-02-08 05:37:40,033 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:37:40,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 673 events. 15/673 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1764 event pairs, 7 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 623. Up to 25 conditions per place. [2025-02-08 05:37:40,041 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-02-08 05:37:40,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 838 flow [2025-02-08 05:37:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:40,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:40,043 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 814 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:40,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 838 flow [2025-02-08 05:37:40,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:40,048 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 812 flow [2025-02-08 05:37:40,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2025-02-08 05:37:40,050 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-02-08 05:37:40,050 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 812 flow [2025-02-08 05:37:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:40,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,051 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] [2025-02-08 05:37:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:40,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1469056544, now seen corresponding path program 1 times [2025-02-08 05:37:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105371126] [2025-02-08 05:37:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:37:40,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:37:40,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105371126] [2025-02-08 05:37:40,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105371126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784334569] [2025-02-08 05:37:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-02-08 05:37:40,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:40,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-02-08 05:37:40,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,170 INFO L124 PetriNetUnfolderBase]: 15/663 cut-off events. [2025-02-08 05:37:40,170 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-08 05:37:40,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 663 events. 15/663 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1730 event pairs, 7 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 605. Up to 25 conditions per place. [2025-02-08 05:37:40,177 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-02-08 05:37:40,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 836 flow [2025-02-08 05:37:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-02-08 05:37:40,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-02-08 05:37:40,180 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 812 flow. Second operand 3 states and 1262 transitions. [2025-02-08 05:37:40,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 836 flow [2025-02-08 05:37:40,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:40,184 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 810 flow [2025-02-08 05:37:40,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2025-02-08 05:37:40,185 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-02-08 05:37:40,185 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 810 flow [2025-02-08 05:37:40,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 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-02-08 05:37:40,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,186 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] [2025-02-08 05:37:40,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:40,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash 53201906, now seen corresponding path program 1 times [2025-02-08 05:37:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540293876] [2025-02-08 05:37:40,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:37:40,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:37:40,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540293876] [2025-02-08 05:37:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540293876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50872711] [2025-02-08 05:37:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:40,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-02-08 05:37:40,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:40,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,326 INFO L124 PetriNetUnfolderBase]: 21/852 cut-off events. [2025-02-08 05:37:40,326 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:37:40,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 852 events. 21/852 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3573 event pairs, 6 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 798. Up to 31 conditions per place. [2025-02-08 05:37:40,341 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:40,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 846 flow [2025-02-08 05:37:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:40,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:40,344 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 810 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:40,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 846 flow [2025-02-08 05:37:40,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:40,350 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 816 flow [2025-02-08 05:37:40,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2025-02-08 05:37:40,351 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-02-08 05:37:40,351 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 816 flow [2025-02-08 05:37:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-02-08 05:37:40,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,352 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] [2025-02-08 05:37:40,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:40,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash -412548429, now seen corresponding path program 1 times [2025-02-08 05:37:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087483135] [2025-02-08 05:37:40,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:37:40,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:37:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087483135] [2025-02-08 05:37:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087483135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336139711] [2025-02-08 05:37:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:40,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-02-08 05:37:40,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:40,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,517 INFO L124 PetriNetUnfolderBase]: 24/1006 cut-off events. [2025-02-08 05:37:40,517 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:40,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1006 events. 24/1006 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4935 event pairs, 6 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 857. Up to 33 conditions per place. [2025-02-08 05:37:40,526 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:40,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 402 transitions, 852 flow [2025-02-08 05:37:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:40,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:40,528 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 816 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 402 transitions, 852 flow [2025-02-08 05:37:40,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,532 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2025-02-08 05:37:40,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2025-02-08 05:37:40,533 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-02-08 05:37:40,533 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2025-02-08 05:37:40,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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-02-08 05:37:40,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,534 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] [2025-02-08 05:37:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:40,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash 569392417, now seen corresponding path program 1 times [2025-02-08 05:37:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038929863] [2025-02-08 05:37:40,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:37:40,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:37:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,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-02-08 05:37:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038929863] [2025-02-08 05:37:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038929863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987124149] [2025-02-08 05:37:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:40,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:40,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:40,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,764 INFO L124 PetriNetUnfolderBase]: 44/1634 cut-off events. [2025-02-08 05:37:40,764 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-02-08 05:37:40,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1634 events. 44/1634 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10899 event pairs, 11 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2025-02-08 05:37:40,783 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:40,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 862 flow [2025-02-08 05:37:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:40,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:40,786 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:40,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 862 flow [2025-02-08 05:37:40,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:40,791 INFO L231 Difference]: Finished difference. Result has 403 places, 400 transitions, 836 flow [2025-02-08 05:37:40,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=403, PETRI_TRANSITIONS=400} [2025-02-08 05:37:40,793 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-02-08 05:37:40,793 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 400 transitions, 836 flow [2025-02-08 05:37:40,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:40,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,794 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-02-08 05:37:40,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:40,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:40,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1725296610, now seen corresponding path program 1 times [2025-02-08 05:37:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-02-08 05:37:40,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:40,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:40,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149565430] [2025-02-08 05:37:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149565430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137966629] [2025-02-08 05:37:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:40,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 400 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:40,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,984 INFO L124 PetriNetUnfolderBase]: 42/1269 cut-off events. [2025-02-08 05:37:40,985 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-02-08 05:37:40,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1269 events. 42/1269 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7605 event pairs, 5 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 1159. Up to 50 conditions per place. [2025-02-08 05:37:40,997 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:40,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 872 flow [2025-02-08 05:37:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:40,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:40,999 INFO L175 Difference]: Start difference. First operand has 403 places, 400 transitions, 836 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:40,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 872 flow [2025-02-08 05:37:41,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 402 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,003 INFO L231 Difference]: Finished difference. Result has 404 places, 400 transitions, 846 flow [2025-02-08 05:37:41,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=404, PETRI_TRANSITIONS=400} [2025-02-08 05:37:41,004 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-02-08 05:37:41,004 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 400 transitions, 846 flow [2025-02-08 05:37:41,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:41,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,005 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] [2025-02-08 05:37:41,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:41,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1441219183, now seen corresponding path program 1 times [2025-02-08 05:37:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412896980] [2025-02-08 05:37:41,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-08 05:37:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 05:37:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412896980] [2025-02-08 05:37:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412896980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12185493] [2025-02-08 05:37:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:41,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 400 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:41,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:41,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,199 INFO L124 PetriNetUnfolderBase]: 61/1652 cut-off events. [2025-02-08 05:37:41,200 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2025-02-08 05:37:41,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1652 events. 61/1652 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9826 event pairs, 18 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1523. Up to 70 conditions per place. [2025-02-08 05:37:41,218 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:41,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 882 flow [2025-02-08 05:37:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:41,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:41,220 INFO L175 Difference]: Start difference. First operand has 404 places, 400 transitions, 846 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:41,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 882 flow [2025-02-08 05:37:41,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,224 INFO L231 Difference]: Finished difference. Result has 405 places, 400 transitions, 856 flow [2025-02-08 05:37:41,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2025-02-08 05:37:41,225 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-02-08 05:37:41,225 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 856 flow [2025-02-08 05:37:41,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:41,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,226 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] [2025-02-08 05:37:41,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:41,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2032133998, now seen corresponding path program 1 times [2025-02-08 05:37:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615940194] [2025-02-08 05:37:41,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-08 05:37:41,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 05:37:41,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615940194] [2025-02-08 05:37:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615940194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114679725] [2025-02-08 05:37:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-02-08 05:37:41,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:41,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-02-08 05:37:41,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,436 INFO L124 PetriNetUnfolderBase]: 70/1820 cut-off events. [2025-02-08 05:37:41,436 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2025-02-08 05:37:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1820 events. 70/1820 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11170 event pairs, 10 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 1718. Up to 80 conditions per place. [2025-02-08 05:37:41,456 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-02-08 05:37:41,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 402 transitions, 892 flow [2025-02-08 05:37:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:41,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:41,458 INFO L175 Difference]: Start difference. First operand has 405 places, 400 transitions, 856 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:41,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 402 transitions, 892 flow [2025-02-08 05:37:41,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 402 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,462 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 866 flow [2025-02-08 05:37:41,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2025-02-08 05:37:41,463 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2025-02-08 05:37:41,463 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 866 flow [2025-02-08 05:37:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 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-02-08 05:37:41,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,464 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] [2025-02-08 05:37:41,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:41,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash -905723822, now seen corresponding path program 1 times [2025-02-08 05:37:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742041420] [2025-02-08 05:37:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:37:41,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:37:41,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742041420] [2025-02-08 05:37:41,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742041420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559667603] [2025-02-08 05:37:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-02-08 05:37:41,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-02-08 05:37:41,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-02-08 05:37:41,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,716 INFO L124 PetriNetUnfolderBase]: 178/1862 cut-off events. [2025-02-08 05:37:41,716 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:37:41,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1862 events. 178/1862 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13015 event pairs, 84 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 1917. Up to 293 conditions per place. [2025-02-08 05:37:41,730 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-02-08 05:37:41,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 906 flow [2025-02-08 05:37:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-02-08 05:37:41,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-02-08 05:37:41,733 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 866 flow. Second operand 3 states and 1259 transitions. [2025-02-08 05:37:41,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 906 flow [2025-02-08 05:37:41,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 400 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,737 INFO L231 Difference]: Finished difference. Result has 405 places, 398 transitions, 872 flow [2025-02-08 05:37:41,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2025-02-08 05:37:41,737 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-02-08 05:37:41,737 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 872 flow [2025-02-08 05:37:41,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-02-08 05:37:41,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,738 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-02-08 05:37:41,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:41,738 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1477797779, now seen corresponding path program 1 times [2025-02-08 05:37:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668813919] [2025-02-08 05:37:41,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:37:41,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:37:41,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668813919] [2025-02-08 05:37:41,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668813919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182395713] [2025-02-08 05:37:41,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-02-08 05:37:41,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-02-08 05:37:41,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-02-08 05:37:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,974 INFO L124 PetriNetUnfolderBase]: 123/1527 cut-off events. [2025-02-08 05:37:41,974 INFO L125 PetriNetUnfolderBase]: For 12/42 co-relation queries the response was YES. [2025-02-08 05:37:41,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1527 events. 123/1527 cut-off events. For 12/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9599 event pairs, 28 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 1543. Up to 152 conditions per place. [2025-02-08 05:37:41,987 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2025-02-08 05:37:41,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 398 transitions, 912 flow [2025-02-08 05:37:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-02-08 05:37:41,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-02-08 05:37:41,990 INFO L175 Difference]: Start difference. First operand has 405 places, 398 transitions, 872 flow. Second operand 3 states and 1259 transitions. [2025-02-08 05:37:41,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 398 transitions, 912 flow [2025-02-08 05:37:41,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 398 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:41,995 INFO L231 Difference]: Finished difference. Result has 404 places, 396 transitions, 878 flow [2025-02-08 05:37:41,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2025-02-08 05:37:41,996 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-02-08 05:37:41,996 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 878 flow [2025-02-08 05:37:41,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-02-08 05:37:41,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,997 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-02-08 05:37:41,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:41,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1667494501, now seen corresponding path program 1 times [2025-02-08 05:37:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362248050] [2025-02-08 05:37:41,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:42,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:42,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362248050] [2025-02-08 05:37:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362248050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078032174] [2025-02-08 05:37:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-02-08 05:37:42,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-02-08 05:37:42,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-02-08 05:37:42,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,261 INFO L124 PetriNetUnfolderBase]: 60/1524 cut-off events. [2025-02-08 05:37:42,261 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2025-02-08 05:37:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1524 events. 60/1524 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8529 event pairs, 8 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 1416. Up to 38 conditions per place. [2025-02-08 05:37:42,279 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-02-08 05:37:42,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 397 transitions, 908 flow [2025-02-08 05:37:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:42,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:42,282 INFO L175 Difference]: Start difference. First operand has 404 places, 396 transitions, 878 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:42,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 397 transitions, 908 flow [2025-02-08 05:37:42,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 397 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:42,287 INFO L231 Difference]: Finished difference. Result has 405 places, 395 transitions, 880 flow [2025-02-08 05:37:42,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=405, PETRI_TRANSITIONS=395} [2025-02-08 05:37:42,288 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-02-08 05:37:42,288 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 880 flow [2025-02-08 05:37:42,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 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-02-08 05:37:42,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,288 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-02-08 05:37:42,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:42,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:42,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash 770041026, now seen corresponding path program 1 times [2025-02-08 05:37:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603363387] [2025-02-08 05:37:42,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603363387] [2025-02-08 05:37:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603363387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464623002] [2025-02-08 05:37:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-02-08 05:37:42,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-02-08 05:37:42,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-02-08 05:37:42,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,566 INFO L124 PetriNetUnfolderBase]: 222/1927 cut-off events. [2025-02-08 05:37:42,566 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2025-02-08 05:37:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1927 events. 222/1927 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12310 event pairs, 76 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 2166. Up to 346 conditions per place. [2025-02-08 05:37:42,587 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-02-08 05:37:42,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 395 transitions, 920 flow [2025-02-08 05:37:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-02-08 05:37:42,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-02-08 05:37:42,629 INFO L175 Difference]: Start difference. First operand has 405 places, 395 transitions, 880 flow. Second operand 3 states and 1259 transitions. [2025-02-08 05:37:42,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 395 transitions, 920 flow [2025-02-08 05:37:42,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 395 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:42,633 INFO L231 Difference]: Finished difference. Result has 402 places, 393 transitions, 882 flow [2025-02-08 05:37:42,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=393} [2025-02-08 05:37:42,634 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-02-08 05:37:42,635 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 393 transitions, 882 flow [2025-02-08 05:37:42,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 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-02-08 05:37:42,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,635 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-02-08 05:37:42,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:42,635 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:42,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1654653238, now seen corresponding path program 1 times [2025-02-08 05:37:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622615979] [2025-02-08 05:37:42,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:42,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:42,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622615979] [2025-02-08 05:37:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622615979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830228750] [2025-02-08 05:37:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-02-08 05:37:42,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 393 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-02-08 05:37:42,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-02-08 05:37:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:42,837 INFO L124 PetriNetUnfolderBase]: 66/1560 cut-off events. [2025-02-08 05:37:42,837 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-02-08 05:37:42,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1560 events. 66/1560 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8776 event pairs, 6 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 1593. Up to 48 conditions per place. [2025-02-08 05:37:42,856 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-02-08 05:37:42,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 912 flow [2025-02-08 05:37:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:42,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:42,858 INFO L175 Difference]: Start difference. First operand has 402 places, 393 transitions, 882 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:42,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 912 flow [2025-02-08 05:37:42,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 394 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:42,862 INFO L231 Difference]: Finished difference. Result has 403 places, 392 transitions, 884 flow [2025-02-08 05:37:42,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=403, PETRI_TRANSITIONS=392} [2025-02-08 05:37:42,863 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-02-08 05:37:42,863 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 392 transitions, 884 flow [2025-02-08 05:37:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-02-08 05:37:42,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:42,864 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-02-08 05:37:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:42,864 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:42,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:42,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1749900085, now seen corresponding path program 1 times [2025-02-08 05:37:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:42,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-02-08 05:37:42,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:42,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:37:42,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:37:42,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:42,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-02-08 05:37:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627912524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:42,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384078326] [2025-02-08 05:37:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:42,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:42,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-02-08 05:37:42,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 392 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-02-08 05:37:42,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:42,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-02-08 05:37:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,038 INFO L124 PetriNetUnfolderBase]: 74/1231 cut-off events. [2025-02-08 05:37:43,038 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2025-02-08 05:37:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1231 events. 74/1231 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6266 event pairs, 14 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1475. Up to 76 conditions per place. [2025-02-08 05:37:43,052 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2025-02-08 05:37:43,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 914 flow [2025-02-08 05:37:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-02-08 05:37:43,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-02-08 05:37:43,055 INFO L175 Difference]: Start difference. First operand has 403 places, 392 transitions, 884 flow. Second operand 3 states and 1271 transitions. [2025-02-08 05:37:43,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 914 flow [2025-02-08 05:37:43,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 393 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:43,059 INFO L231 Difference]: Finished difference. Result has 402 places, 391 transitions, 882 flow [2025-02-08 05:37:43,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=391} [2025-02-08 05:37:43,060 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-02-08 05:37:43,060 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 391 transitions, 882 flow [2025-02-08 05:37:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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-02-08 05:37:43,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:37:43,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:43,061 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:43,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2060324830, now seen corresponding path program 1 times [2025-02-08 05:37:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249191581] [2025-02-08 05:37:43,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-02-08 05:37:43,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-02-08 05:37:43,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249191581] [2025-02-08 05:37:43,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249191581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116671785] [2025-02-08 05:37:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-02-08 05:37:43,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 391 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-02-08 05:37:43,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,319 INFO L124 PetriNetUnfolderBase]: 60/1538 cut-off events. [2025-02-08 05:37:43,319 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2025-02-08 05:37:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1538 events. 60/1538 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8351 event pairs, 4 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1589. Up to 50 conditions per place. [2025-02-08 05:37:43,335 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2025-02-08 05:37:43,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 390 transitions, 898 flow [2025-02-08 05:37:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-02-08 05:37:43,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2025-02-08 05:37:43,338 INFO L175 Difference]: Start difference. First operand has 402 places, 391 transitions, 882 flow. Second operand 3 states and 1273 transitions. [2025-02-08 05:37:43,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 390 transitions, 898 flow [2025-02-08 05:37:43,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 390 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:43,343 INFO L231 Difference]: Finished difference. Result has 401 places, 390 transitions, 878 flow [2025-02-08 05:37:43,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=401, PETRI_TRANSITIONS=390} [2025-02-08 05:37:43,344 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-02-08 05:37:43,344 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 390 transitions, 878 flow [2025-02-08 05:37:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:37:43,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:43,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 826324924, now seen corresponding path program 1 times [2025-02-08 05:37:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857763470] [2025-02-08 05:37:43,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-08 05:37:43,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-08 05:37:43,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857763470] [2025-02-08 05:37:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857763470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114060496] [2025-02-08 05:37:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-02-08 05:37:43,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 390 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-02-08 05:37:43,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,575 INFO L124 PetriNetUnfolderBase]: 56/1511 cut-off events. [2025-02-08 05:37:43,575 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2025-02-08 05:37:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1511 events. 56/1511 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8171 event pairs, 3 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1698. Up to 48 conditions per place. [2025-02-08 05:37:43,591 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2025-02-08 05:37:43,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 389 transitions, 894 flow [2025-02-08 05:37:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-02-08 05:37:43,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2025-02-08 05:37:43,594 INFO L175 Difference]: Start difference. First operand has 401 places, 390 transitions, 878 flow. Second operand 3 states and 1273 transitions. [2025-02-08 05:37:43,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 389 transitions, 894 flow [2025-02-08 05:37:43,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 389 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:43,598 INFO L231 Difference]: Finished difference. Result has 401 places, 389 transitions, 877 flow [2025-02-08 05:37:43,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2025-02-08 05:37:43,599 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-02-08 05:37:43,599 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 877 flow [2025-02-08 05:37:43,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:43,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:37:43,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:43,600 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:37:43,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:43,601 INFO L85 PathProgramCache]: Analyzing trace with hash 512623956, now seen corresponding path program 1 times [2025-02-08 05:37:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:43,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318458989] [2025-02-08 05:37:43,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:43,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-08 05:37:43,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-08 05:37:43,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:43,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318458989] [2025-02-08 05:37:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318458989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044679481] [2025-02-08 05:37:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:43,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:43,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:43,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-02-08 05:37:43,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:43,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-02-08 05:37:43,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:43,805 INFO L124 PetriNetUnfolderBase]: 52/1170 cut-off events. [2025-02-08 05:37:43,807 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-02-08 05:37:43,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1170 events. 52/1170 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5790 event pairs, 7 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 1358. Up to 42 conditions per place. [2025-02-08 05:37:43,817 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 0 selfloop transitions, 0 changer transitions 388/388 dead transitions. [2025-02-08 05:37:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 388 transitions, 891 flow [2025-02-08 05:37:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2025-02-08 05:37:43,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952808988764045 [2025-02-08 05:37:43,819 INFO L175 Difference]: Start difference. First operand has 401 places, 389 transitions, 877 flow. Second operand 3 states and 1272 transitions. [2025-02-08 05:37:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 388 transitions, 891 flow [2025-02-08 05:37:43,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 388 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:43,822 INFO L231 Difference]: Finished difference. Result has 401 places, 0 transitions, 0 flow [2025-02-08 05:37:43,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=401, PETRI_TRANSITIONS=0} [2025-02-08 05:37:43,823 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-02-08 05:37:43,824 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 0 transitions, 0 flow [2025-02-08 05:37:43,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:37:43,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:37:43,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:37:43,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:37:43,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:37:43,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:37:43,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:37:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:43,832 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] [2025-02-08 05:37:43,837 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:43,837 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:43,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:43 BasicIcfg [2025-02-08 05:37:43,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:43,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:43,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:43,843 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:43,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:37" (3/4) ... [2025-02-08 05:37:43,845 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:43,847 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:43,847 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:43,847 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:43,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:37:43,851 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:43,851 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:43,851 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:43,906 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:43,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:43,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:43,907 INFO L158 Benchmark]: Toolchain (without parser) took 6869.04ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 110.3MB in the beginning and 436.3MB in the end (delta: -326.0MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.18ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 97.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.05ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: Boogie Preprocessor took 36.20ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: IcfgBuilder took 482.17ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 65.4MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,908 INFO L158 Benchmark]: TraceAbstraction took 6040.08ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 65.4MB in the beginning and 440.6MB in the end (delta: -375.2MB). Peak memory consumption was 285.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,909 INFO L158 Benchmark]: Witness Printer took 63.78ms. Allocated memory is still 553.6MB. Free memory was 440.6MB in the beginning and 436.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:43,910 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.18ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 97.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.05ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.20ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 94.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 482.17ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 65.4MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6040.08ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 65.4MB in the beginning and 440.6MB in the end (delta: -375.2MB). Peak memory consumption was 285.6MB. Max. memory is 16.1GB. * Witness Printer took 63.78ms. Allocated memory is still 553.6MB. Free memory was 440.6MB in the beginning and 436.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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, 701 locations, 69 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: 5.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 102 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=20, InterpolantAutomatonStates: 72, 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.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 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 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:43,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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