./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:10:48,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:10:48,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:10:48,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:10:48,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:10:48,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:10:48,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:10:48,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:10:48,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:10:48,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:10:48,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:10:48,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:10:48,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:10:48,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:10:48,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:10:48,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:48,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:10:48,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:10:48,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2025-03-17 11:10:48,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:10:48,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:10:48,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:10:48,879 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:10:48,879 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:10:48,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-03-17 11:10:50,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04108d950/dc94e4a3ca82455fbb6acff04de72015/FLAG57e48d3de [2025-03-17 11:10:50,277 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:10:50,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2025-03-17 11:10:50,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04108d950/dc94e4a3ca82455fbb6acff04de72015/FLAG57e48d3de [2025-03-17 11:10:50,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04108d950/dc94e4a3ca82455fbb6acff04de72015 [2025-03-17 11:10:50,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:10:50,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:10:50,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:50,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:10:50,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:10:50,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ade09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50, skipping insertion in model container [2025-03-17 11:10:50,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:10:50,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:50,463 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:10:50,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:50,487 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:10:50,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50 WrapperNode [2025-03-17 11:10:50,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:50,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:50,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:10:50,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:10:50,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,510 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-17 11:10:50,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:50,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:10:50,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:10:50,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:10:50,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:10:50,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:10:50,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:10:50,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:10:50,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (1/1) ... [2025-03-17 11:10:50,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:50,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:10:50,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:10:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:10:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:10:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 11:10:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:10:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:10:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:10:50,574 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:10:50,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:10:50,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:10:50,961 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:10:50,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:10:50,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:10:50,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:10:50,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:50 BoogieIcfgContainer [2025-03-17 11:10:50,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:10:50,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:10:50,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:10:50,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:10:50,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:10:50" (1/3) ... [2025-03-17 11:10:50,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:50, skipping insertion in model container [2025-03-17 11:10:50,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:50" (2/3) ... [2025-03-17 11:10:50,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283f939d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:50, skipping insertion in model container [2025-03-17 11:10:50,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:50" (3/3) ... [2025-03-17 11:10:50,981 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2025-03-17 11:10:50,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:10:50,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x3.wvr.c that has 5 procedures, 246 locations, 1 initial locations, 4 loop locations, and 35 error locations. [2025-03-17 11:10:50,992 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:10:51,080 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:10:51,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 259 transitions, 546 flow [2025-03-17 11:10:51,183 INFO L124 PetriNetUnfolderBase]: 14/255 cut-off events. [2025-03-17 11:10:51,185 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:10:51,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 255 events. 14/255 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-03-17 11:10:51,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 259 transitions, 546 flow [2025-03-17 11:10:51,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 235 transitions, 494 flow [2025-03-17 11:10:51,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:10:51,207 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;@7058b8af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:10:51,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 11:10:51,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:10:51,216 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-17 11:10:51,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:10:51,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:51,217 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] [2025-03-17 11:10:51,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash 346599642, now seen corresponding path program 1 times [2025-03-17 11:10:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580066103] [2025-03-17 11:10:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:51,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:10:51,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:10:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580066103] [2025-03-17 11:10:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580066103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959461988] [2025-03-17 11:10:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:51,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:51,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:51,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2025-03-17 11:10:51,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 235 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:51,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2025-03-17 11:10:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:51,514 INFO L124 PetriNetUnfolderBase]: 22/310 cut-off events. [2025-03-17 11:10:51,515 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 11:10:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 310 events. 22/310 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1004 event pairs, 12 based on Foata normal form. 37/285 useless extension candidates. Maximal degree in co-relation 294. Up to 46 conditions per place. [2025-03-17 11:10:51,520 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 18 selfloop transitions, 2 changer transitions 1/229 dead transitions. [2025-03-17 11:10:51,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 522 flow [2025-03-17 11:10:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-03-17 11:10:51,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2025-03-17 11:10:51,534 INFO L175 Difference]: Start difference. First operand has 236 places, 235 transitions, 494 flow. Second operand 3 states and 716 transitions. [2025-03-17 11:10:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 522 flow [2025-03-17 11:10:51,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:10:51,544 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 468 flow [2025-03-17 11:10:51,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2025-03-17 11:10:51,549 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -7 predicate places. [2025-03-17 11:10:51,551 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 468 flow [2025-03-17 11:10:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:51,552 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-03-17 11:10:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:10:51,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:51,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1923164421, now seen corresponding path program 1 times [2025-03-17 11:10:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-17 11:10:51,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:10:51,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:10:51,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:51,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-17 11:10:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710442891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:51,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:51,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690113267] [2025-03-17 11:10:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:51,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:51,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:51,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-03-17 11:10:51,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:51,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-03-17 11:10:51,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:51,680 INFO L124 PetriNetUnfolderBase]: 22/308 cut-off events. [2025-03-17 11:10:51,680 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:10:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 308 events. 22/308 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 940 event pairs, 12 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 341. Up to 45 conditions per place. [2025-03-17 11:10:51,685 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2025-03-17 11:10:51,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 227 transitions, 504 flow [2025-03-17 11:10:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:10:51,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-03-17 11:10:51,687 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 468 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:10:51,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 227 transitions, 504 flow [2025-03-17 11:10:51,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:51,692 INFO L231 Difference]: Finished difference. Result has 227 places, 227 transitions, 466 flow [2025-03-17 11:10:51,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=227} [2025-03-17 11:10:51,694 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -9 predicate places. [2025-03-17 11:10:51,694 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 227 transitions, 466 flow [2025-03-17 11:10:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:51,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:10:51,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:51,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1642037646, now seen corresponding path program 1 times [2025-03-17 11:10:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431654010] [2025-03-17 11:10:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:10:51,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:10:51,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:51,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431654010] [2025-03-17 11:10:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431654010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626975957] [2025-03-17 11:10:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:51,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259 [2025-03-17 11:10:51,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 227 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:51,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259 [2025-03-17 11:10:51,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:51,841 INFO L124 PetriNetUnfolderBase]: 22/289 cut-off events. [2025-03-17 11:10:51,841 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:10:51,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 289 events. 22/289 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 794 event pairs, 12 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 312. Up to 46 conditions per place. [2025-03-17 11:10:51,843 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2025-03-17 11:10:51,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 504 flow [2025-03-17 11:10:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-17 11:10:51,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2025-03-17 11:10:51,846 INFO L175 Difference]: Start difference. First operand has 227 places, 227 transitions, 466 flow. Second operand 3 states and 711 transitions. [2025-03-17 11:10:51,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 504 flow [2025-03-17 11:10:51,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:51,850 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 464 flow [2025-03-17 11:10:51,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2025-03-17 11:10:51,851 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -10 predicate places. [2025-03-17 11:10:51,851 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 464 flow [2025-03-17 11:10:51,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:51,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:51,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:10:51,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash 715307007, now seen corresponding path program 1 times [2025-03-17 11:10:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-03-17 11:10:51,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:51,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:51,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:10:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:10:51,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:51,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-03-17 11:10:51,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:51,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89358647] [2025-03-17 11:10:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89358647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459165186] [2025-03-17 11:10:51,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:51,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:51,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:51,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:51,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-03-17 11:10:51,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:51,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-03-17 11:10:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:51,974 INFO L124 PetriNetUnfolderBase]: 22/270 cut-off events. [2025-03-17 11:10:51,974 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:10:51,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 270 events. 22/270 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs, 12 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 281. Up to 45 conditions per place. [2025-03-17 11:10:51,976 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-17 11:10:51,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 500 flow [2025-03-17 11:10:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:10:51,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-03-17 11:10:51,978 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 464 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:10:51,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 500 flow [2025-03-17 11:10:51,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:51,981 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 462 flow [2025-03-17 11:10:51,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2025-03-17 11:10:51,982 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -11 predicate places. [2025-03-17 11:10:51,982 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 462 flow [2025-03-17 11:10:51,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:51,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:51,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:51,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:10:51,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1338582313, now seen corresponding path program 1 times [2025-03-17 11:10:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186162371] [2025-03-17 11:10:51,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:51,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:10:51,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:10:51,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:51,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186162371] [2025-03-17 11:10:52,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186162371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377462494] [2025-03-17 11:10:52,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-03-17 11:10:52,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-03-17 11:10:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,186 INFO L124 PetriNetUnfolderBase]: 102/982 cut-off events. [2025-03-17 11:10:52,187 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:10:52,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 982 events. 102/982 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6253 event pairs, 51 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1096. Up to 144 conditions per place. [2025-03-17 11:10:52,192 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-03-17 11:10:52,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 224 transitions, 494 flow [2025-03-17 11:10:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-17 11:10:52,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-03-17 11:10:52,195 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 462 flow. Second operand 3 states and 717 transitions. [2025-03-17 11:10:52,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 224 transitions, 494 flow [2025-03-17 11:10:52,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 224 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:52,200 INFO L231 Difference]: Finished difference. Result has 224 places, 224 transitions, 460 flow [2025-03-17 11:10:52,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=224} [2025-03-17 11:10:52,201 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -12 predicate places. [2025-03-17 11:10:52,201 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 224 transitions, 460 flow [2025-03-17 11:10:52,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:10:52,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1336410723, now seen corresponding path program 1 times [2025-03-17 11:10:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985822166] [2025-03-17 11:10:52,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:10:52,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:10:52,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985822166] [2025-03-17 11:10:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985822166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075485793] [2025-03-17 11:10:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2025-03-17 11:10:52,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 224 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2025-03-17 11:10:52,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,325 INFO L124 PetriNetUnfolderBase]: 31/300 cut-off events. [2025-03-17 11:10:52,326 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:10:52,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 300 events. 31/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1022 event pairs, 18 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 340. Up to 60 conditions per place. [2025-03-17 11:10:52,330 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 23 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-17 11:10:52,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 222 transitions, 511 flow [2025-03-17 11:10:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2025-03-17 11:10:52,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060489060489061 [2025-03-17 11:10:52,332 INFO L175 Difference]: Start difference. First operand has 224 places, 224 transitions, 460 flow. Second operand 3 states and 704 transitions. [2025-03-17 11:10:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 222 transitions, 511 flow [2025-03-17 11:10:52,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 222 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:52,336 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 457 flow [2025-03-17 11:10:52,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=219} [2025-03-17 11:10:52,337 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2025-03-17 11:10:52,338 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 457 flow [2025-03-17 11:10:52,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,339 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] [2025-03-17 11:10:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:10:52,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash 95492134, now seen corresponding path program 1 times [2025-03-17 11:10:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188273909] [2025-03-17 11:10:52,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:10:52,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:10:52,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188273909] [2025-03-17 11:10:52,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188273909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045871268] [2025-03-17 11:10:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2025-03-17 11:10:52,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2025-03-17 11:10:52,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,436 INFO L124 PetriNetUnfolderBase]: 31/296 cut-off events. [2025-03-17 11:10:52,437 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:10:52,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 296 events. 31/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 956 event pairs, 18 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 322. Up to 58 conditions per place. [2025-03-17 11:10:52,440 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 21 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2025-03-17 11:10:52,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2025-03-17 11:10:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-17 11:10:52,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137709137709138 [2025-03-17 11:10:52,442 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 457 flow. Second operand 3 states and 710 transitions. [2025-03-17 11:10:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2025-03-17 11:10:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:52,445 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 457 flow [2025-03-17 11:10:52,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2025-03-17 11:10:52,446 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -20 predicate places. [2025-03-17 11:10:52,446 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 457 flow [2025-03-17 11:10:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:52,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:10:52,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash -899382347, now seen corresponding path program 1 times [2025-03-17 11:10:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575058616] [2025-03-17 11:10:52,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:10:52,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:10:52,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575058616] [2025-03-17 11:10:52,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575058616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284204209] [2025-03-17 11:10:52,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259 [2025-03-17 11:10:52,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259 [2025-03-17 11:10:52,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,583 INFO L124 PetriNetUnfolderBase]: 39/409 cut-off events. [2025-03-17 11:10:52,583 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 11:10:52,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 409 events. 39/409 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1614 event pairs, 15 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 444. Up to 64 conditions per place. [2025-03-17 11:10:52,587 INFO L140 encePairwiseOnDemand]: 249/259 looper letters, 26 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2025-03-17 11:10:52,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 217 transitions, 527 flow [2025-03-17 11:10:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2025-03-17 11:10:52,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9111969111969112 [2025-03-17 11:10:52,589 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 457 flow. Second operand 3 states and 708 transitions. [2025-03-17 11:10:52,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 217 transitions, 527 flow [2025-03-17 11:10:52,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:52,592 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 462 flow [2025-03-17 11:10:52,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2025-03-17 11:10:52,593 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2025-03-17 11:10:52,593 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 462 flow [2025-03-17 11:10:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,593 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] [2025-03-17 11:10:52,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:10:52,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1017994860, now seen corresponding path program 1 times [2025-03-17 11:10:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029245060] [2025-03-17 11:10:52,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:10:52,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:10:52,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029245060] [2025-03-17 11:10:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029245060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:10:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911061073] [2025-03-17 11:10:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:10:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:10:52,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:10:52,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-03-17 11:10:52,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-03-17 11:10:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,717 INFO L124 PetriNetUnfolderBase]: 12/347 cut-off events. [2025-03-17 11:10:52,718 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:10:52,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 347 events. 12/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1119 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 291. Up to 26 conditions per place. [2025-03-17 11:10:52,721 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 19 selfloop transitions, 5 changer transitions 0/216 dead transitions. [2025-03-17 11:10:52,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 520 flow [2025-03-17 11:10:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:10:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:10:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1185 transitions. [2025-03-17 11:10:52,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915057915057915 [2025-03-17 11:10:52,724 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 462 flow. Second operand 5 states and 1185 transitions. [2025-03-17 11:10:52,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 520 flow [2025-03-17 11:10:52,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:52,728 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 496 flow [2025-03-17 11:10:52,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2025-03-17 11:10:52,729 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places. [2025-03-17 11:10:52,729 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 496 flow [2025-03-17 11:10:52,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:52,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:10:52,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1672537186, now seen corresponding path program 1 times [2025-03-17 11:10:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054855044] [2025-03-17 11:10:52,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:10:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:10:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054855044] [2025-03-17 11:10:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054855044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486163561] [2025-03-17 11:10:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259 [2025-03-17 11:10:52,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259 [2025-03-17 11:10:52,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:52,854 INFO L124 PetriNetUnfolderBase]: 58/561 cut-off events. [2025-03-17 11:10:52,854 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-17 11:10:52,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 561 events. 58/561 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2796 event pairs, 5 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 497. Up to 92 conditions per place. [2025-03-17 11:10:52,857 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 22 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2025-03-17 11:10:52,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 563 flow [2025-03-17 11:10:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:10:52,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176 [2025-03-17 11:10:52,859 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 496 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:10:52,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 563 flow [2025-03-17 11:10:52,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:10:52,861 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 478 flow [2025-03-17 11:10:52,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=217, PETRI_TRANSITIONS=201} [2025-03-17 11:10:52,862 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -19 predicate places. [2025-03-17 11:10:52,862 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 478 flow [2025-03-17 11:10:52,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:52,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:52,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:10:52,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:52,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1809647071, now seen corresponding path program 1 times [2025-03-17 11:10:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:52,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784974928] [2025-03-17 11:10:52,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:52,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:10:52,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:10:52,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:52,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784974928] [2025-03-17 11:10:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784974928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584453395] [2025-03-17 11:10:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:52,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:52,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:52,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:52,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259 [2025-03-17 11:10:52,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:52,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:52,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259 [2025-03-17 11:10:52,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:53,312 INFO L124 PetriNetUnfolderBase]: 746/4032 cut-off events. [2025-03-17 11:10:53,313 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-17 11:10:53,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4032 events. 746/4032 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40452 event pairs, 276 based on Foata normal form. 0/3540 useless extension candidates. Maximal degree in co-relation 4163. Up to 1027 conditions per place. [2025-03-17 11:10:53,386 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 19 selfloop transitions, 4 changer transitions 0/204 dead transitions. [2025-03-17 11:10:53,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 204 transitions, 533 flow [2025-03-17 11:10:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2025-03-17 11:10:53,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266409266409267 [2025-03-17 11:10:53,391 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 478 flow. Second operand 3 states and 720 transitions. [2025-03-17 11:10:53,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 204 transitions, 533 flow [2025-03-17 11:10:53,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:10:53,401 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 495 flow [2025-03-17 11:10:53,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2025-03-17 11:10:53,401 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2025-03-17 11:10:53,402 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 495 flow [2025-03-17 11:10:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:53,402 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] [2025-03-17 11:10:53,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:10:53,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:53,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1879618673, now seen corresponding path program 1 times [2025-03-17 11:10:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929842267] [2025-03-17 11:10:53,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:53,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:10:53,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:10:53,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:53,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:53,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929842267] [2025-03-17 11:10:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929842267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:53,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:53,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880879017] [2025-03-17 11:10:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:53,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:53,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:53,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:53,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-03-17 11:10:53,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:53,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-03-17 11:10:53,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:53,579 INFO L124 PetriNetUnfolderBase]: 203/1313 cut-off events. [2025-03-17 11:10:53,579 INFO L125 PetriNetUnfolderBase]: For 23/35 co-relation queries the response was YES. [2025-03-17 11:10:53,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1313 events. 203/1313 cut-off events. For 23/35 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9866 event pairs, 64 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1269. Up to 174 conditions per place. [2025-03-17 11:10:53,592 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 19 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2025-03-17 11:10:53,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 544 flow [2025-03-17 11:10:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-17 11:10:53,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-03-17 11:10:53,594 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 495 flow. Second operand 3 states and 717 transitions. [2025-03-17 11:10:53,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 544 flow [2025-03-17 11:10:53,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:10:53,597 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 497 flow [2025-03-17 11:10:53,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2025-03-17 11:10:53,597 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -30 predicate places. [2025-03-17 11:10:53,598 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 497 flow [2025-03-17 11:10:53,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:53,598 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] [2025-03-17 11:10:53,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:10:53,598 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash -795939286, now seen corresponding path program 1 times [2025-03-17 11:10:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035274264] [2025-03-17 11:10:53,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:53,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:53,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:10:53,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:10:53,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:53,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:53,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:53,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035274264] [2025-03-17 11:10:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035274264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:53,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:53,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:53,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995062891] [2025-03-17 11:10:53,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:53,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:53,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:53,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:53,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:53,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-03-17 11:10:53,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:53,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-03-17 11:10:53,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:53,842 INFO L124 PetriNetUnfolderBase]: 314/1609 cut-off events. [2025-03-17 11:10:53,842 INFO L125 PetriNetUnfolderBase]: For 88/96 co-relation queries the response was YES. [2025-03-17 11:10:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1609 events. 314/1609 cut-off events. For 88/96 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12720 event pairs, 121 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 2449. Up to 298 conditions per place. [2025-03-17 11:10:53,858 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-03-17 11:10:53,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 544 flow [2025-03-17 11:10:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-17 11:10:53,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2025-03-17 11:10:53,860 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 497 flow. Second operand 3 states and 719 transitions. [2025-03-17 11:10:53,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 544 flow [2025-03-17 11:10:53,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:53,866 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 495 flow [2025-03-17 11:10:53,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-03-17 11:10:53,867 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places. [2025-03-17 11:10:53,867 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 495 flow [2025-03-17 11:10:53,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:10:53,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1850424116, now seen corresponding path program 1 times [2025-03-17 11:10:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:53,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418728035] [2025-03-17 11:10:53,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:53,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:10:53,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:10:53,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:53,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418728035] [2025-03-17 11:10:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418728035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:53,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447429838] [2025-03-17 11:10:53,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:53,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:53,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:53,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:53,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259 [2025-03-17 11:10:53,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:53,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:53,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259 [2025-03-17 11:10:53,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:54,073 INFO L124 PetriNetUnfolderBase]: 228/1270 cut-off events. [2025-03-17 11:10:54,074 INFO L125 PetriNetUnfolderBase]: For 95/98 co-relation queries the response was YES. [2025-03-17 11:10:54,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 1270 events. 228/1270 cut-off events. For 95/98 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9039 event pairs, 80 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1797. Up to 223 conditions per place. [2025-03-17 11:10:54,086 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 20 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-17 11:10:54,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 546 flow [2025-03-17 11:10:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-17 11:10:54,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228 [2025-03-17 11:10:54,089 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 495 flow. Second operand 3 states and 717 transitions. [2025-03-17 11:10:54,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 546 flow [2025-03-17 11:10:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:54,093 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 493 flow [2025-03-17 11:10:54,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2025-03-17 11:10:54,095 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -32 predicate places. [2025-03-17 11:10:54,095 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 493 flow [2025-03-17 11:10:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:54,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:10:54,096 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] [2025-03-17 11:10:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:10:54,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2025-03-17 11:10:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:10:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1043843853, now seen corresponding path program 1 times [2025-03-17 11:10:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:10:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794268580] [2025-03-17 11:10:54,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:10:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:10:54,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:10:54,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:10:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:10:54,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:10:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:10:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:10:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794268580] [2025-03-17 11:10:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794268580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:10:54,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:10:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:10:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705565005] [2025-03-17 11:10:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:10:54,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:10:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:10:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:10:54,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:10:54,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259 [2025-03-17 11:10:54,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:10:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259 [2025-03-17 11:10:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:10:54,246 INFO L124 PetriNetUnfolderBase]: 145/1013 cut-off events. [2025-03-17 11:10:54,246 INFO L125 PetriNetUnfolderBase]: For 74/81 co-relation queries the response was YES. [2025-03-17 11:10:54,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 1013 events. 145/1013 cut-off events. For 74/81 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6559 event pairs, 39 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 1346. Up to 129 conditions per place. [2025-03-17 11:10:54,252 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 0 selfloop transitions, 0 changer transitions 200/200 dead transitions. [2025-03-17 11:10:54,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 540 flow [2025-03-17 11:10:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:10:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:10:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-17 11:10:54,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254 [2025-03-17 11:10:54,254 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 493 flow. Second operand 3 states and 719 transitions. [2025-03-17 11:10:54,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 540 flow [2025-03-17 11:10:54,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 200 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:10:54,256 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow [2025-03-17 11:10:54,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0} [2025-03-17 11:10:54,257 INFO L279 CegarLoopForPetriNet]: 236 programPoint places, -33 predicate places. [2025-03-17 11:10:54,257 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow [2025-03-17 11:10:54,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining) [2025-03-17 11:10:54,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining) [2025-03-17 11:10:54,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 59 remaining) [2025-03-17 11:10:54,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining) [2025-03-17 11:10:54,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining) [2025-03-17 11:10:54,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining) [2025-03-17 11:10:54,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:10:54,265 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:10:54,270 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:10:54,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:10:54,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:10:54 BasicIcfg [2025-03-17 11:10:54,275 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:10:54,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:10:54,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:10:54,275 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:10:54,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:50" (3/4) ... [2025-03-17 11:10:54,277 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:10:54,279 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:10:54,279 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:10:54,279 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:10:54,279 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-17 11:10:54,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 11:10:54,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:10:54,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:10:54,284 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:10:54,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:10:54,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:10:54,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:10:54,340 INFO L158 Benchmark]: Toolchain (without parser) took 4033.50ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.9MB in the beginning and 104.6MB in the end (delta: 2.2MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2025-03-17 11:10:54,340 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:10:54,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.02ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:10:54,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.68ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.4MB in the end (delta: 728.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:10:54,342 INFO L158 Benchmark]: Boogie Preprocessor took 13.10ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.4MB in the end (delta: 949.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:10:54,342 INFO L158 Benchmark]: IcfgBuilder took 449.19ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 71.6MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:10:54,342 INFO L158 Benchmark]: TraceAbstraction took 3299.13ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.6MB in the beginning and 109.7MB in the end (delta: -39.0MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2025-03-17 11:10:54,343 INFO L158 Benchmark]: Witness Printer took 64.04ms. Allocated memory is still 335.5MB. Free memory was 109.7MB in the beginning and 104.6MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:10:54,344 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.78ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.02ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.1MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.68ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.4MB in the end (delta: 728.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.10ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.4MB in the end (delta: 949.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 449.19ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 71.6MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3299.13ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 70.6MB in the beginning and 109.7MB in the end (delta: -39.0MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. * Witness Printer took 64.04ms. Allocated memory is still 335.5MB. Free memory was 109.7MB in the beginning and 104.6MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 342 locations, 363 edges, 59 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: 3.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 103 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=12, InterpolantAutomatonStates: 47, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:10:54,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE