./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-simple-equiv.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/parallel-simple-equiv.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 de0411014dc6a77a3d6f6b87d1d3911a4ed9d471cff70aeb544ffa33b63e5b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:25,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:25,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:25,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:25,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:25,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:25,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:25,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:25,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:25,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:25,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:25,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:25,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:25,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:25,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:25,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:25,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:25,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:25,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:25,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:25,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:25,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:25,985 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 -> de0411014dc6a77a3d6f6b87d1d3911a4ed9d471cff70aeb544ffa33b63e5b55 [2025-03-17 11:13:26,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:26,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:26,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:26,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:26,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:26,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2025-03-17 11:13:27,436 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4ec1f99/e6dd298d336c4c538dc6440c8ba89339/FLAGd34921fd0 [2025-03-17 11:13:27,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:27,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2025-03-17 11:13:27,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4ec1f99/e6dd298d336c4c538dc6440c8ba89339/FLAGd34921fd0 [2025-03-17 11:13:27,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4ec1f99/e6dd298d336c4c538dc6440c8ba89339 [2025-03-17 11:13:27,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:27,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:27,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:27,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:28,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:28,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:27" (1/1) ... [2025-03-17 11:13:28,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241377b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28, skipping insertion in model container [2025-03-17 11:13:28,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:27" (1/1) ... [2025-03-17 11:13:28,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:28,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:28,149 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:28,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:28,173 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:28,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28 WrapperNode [2025-03-17 11:13:28,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:28,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:28,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:28,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:28,180 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:13:28" (1/1) ... [2025-03-17 11:13:28,186 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:13:28" (1/1) ... [2025-03-17 11:13:28,199 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2025-03-17 11:13:28,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:28,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:28,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:28,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:28,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:28,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:28,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:28,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:28,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (1/1) ... [2025-03-17 11:13:28,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:28,256 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:13:28,259 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:13:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:28,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:28,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:28,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:28,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:28,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:28,280 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:13:28,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:28,357 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:28,530 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:28,530 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:28,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:28,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:28,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:28 BoogieIcfgContainer [2025-03-17 11:13:28,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:28,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:28,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:28,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:28,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:27" (1/3) ... [2025-03-17 11:13:28,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366356aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:28, skipping insertion in model container [2025-03-17 11:13:28,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:28" (2/3) ... [2025-03-17 11:13:28,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366356aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:28, skipping insertion in model container [2025-03-17 11:13:28,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:28" (3/3) ... [2025-03-17 11:13:28,564 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-simple-equiv.wvr.c [2025-03-17 11:13:28,574 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:28,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-simple-equiv.wvr.c that has 4 procedures, 135 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-17 11:13:28,578 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:28,649 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:13:28,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 136 transitions, 293 flow [2025-03-17 11:13:28,737 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2025-03-17 11:13:28,740 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:13:28,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2025-03-17 11:13:28,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 136 transitions, 293 flow [2025-03-17 11:13:28,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 116 transitions, 250 flow [2025-03-17 11:13:28,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:28,767 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;@61b5139, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:28,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 11:13:28,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:28,776 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-17 11:13:28,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:28,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:28,776 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:13:28,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:28,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 893182671, now seen corresponding path program 1 times [2025-03-17 11:13:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758451095] [2025-03-17 11:13:28,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:28,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:13:28,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:13:28,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:28,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:28,933 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:13:28,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:28,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758451095] [2025-03-17 11:13:28,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758451095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146413320] [2025-03-17 11:13:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:28,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:28,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2025-03-17 11:13:29,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:13:29,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2025-03-17 11:13:29,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,112 INFO L124 PetriNetUnfolderBase]: 39/249 cut-off events. [2025-03-17 11:13:29,112 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-17 11:13:29,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 249 events. 39/249 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 803 event pairs, 39 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 265. Up to 88 conditions per place. [2025-03-17 11:13:29,115 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 18 selfloop transitions, 2 changer transitions 1/114 dead transitions. [2025-03-17 11:13:29,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 286 flow [2025-03-17 11:13:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-17 11:13:29,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8700980392156863 [2025-03-17 11:13:29,126 INFO L175 Difference]: Start difference. First operand has 125 places, 116 transitions, 250 flow. Second operand 3 states and 355 transitions. [2025-03-17 11:13:29,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 286 flow [2025-03-17 11:13:29,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 274 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:13:29,133 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 236 flow [2025-03-17 11:13:29,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2025-03-17 11:13:29,139 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -5 predicate places. [2025-03-17 11:13:29,139 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 236 flow [2025-03-17 11:13:29,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:13:29,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,139 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:13:29,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:29,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 400383001, now seen corresponding path program 1 times [2025-03-17 11:13:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944660230] [2025-03-17 11:13:29,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:13:29,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:13:29,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,203 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:13:29,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944660230] [2025-03-17 11:13:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944660230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669469032] [2025-03-17 11:13:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2025-03-17 11:13:29,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:13:29,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2025-03-17 11:13:29,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,300 INFO L124 PetriNetUnfolderBase]: 39/247 cut-off events. [2025-03-17 11:13:29,300 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-17 11:13:29,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 247 events. 39/247 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 787 event pairs, 39 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 315. Up to 86 conditions per place. [2025-03-17 11:13:29,303 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 16 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-03-17 11:13:29,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 270 flow [2025-03-17 11:13:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-03-17 11:13:29,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2025-03-17 11:13:29,305 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 236 flow. Second operand 3 states and 358 transitions. [2025-03-17 11:13:29,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 270 flow [2025-03-17 11:13:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,308 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 234 flow [2025-03-17 11:13:29,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-03-17 11:13:29,308 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -7 predicate places. [2025-03-17 11:13:29,308 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 234 flow [2025-03-17 11:13:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:13:29,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:29,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:29,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash -207554662, now seen corresponding path program 1 times [2025-03-17 11:13:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134310353] [2025-03-17 11:13:29,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:13:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:13:29,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,352 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:13:29,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134310353] [2025-03-17 11:13:29,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134310353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736532077] [2025-03-17 11:13:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2025-03-17 11:13:29,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:29,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2025-03-17 11:13:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,451 INFO L124 PetriNetUnfolderBase]: 55/415 cut-off events. [2025-03-17 11:13:29,452 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 11:13:29,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 415 events. 55/415 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1803 event pairs, 39 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 505. Up to 83 conditions per place. [2025-03-17 11:13:29,455 INFO L140 encePairwiseOnDemand]: 127/136 looper letters, 17 selfloop transitions, 4 changer transitions 2/112 dead transitions. [2025-03-17 11:13:29,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 282 flow [2025-03-17 11:13:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-17 11:13:29,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2025-03-17 11:13:29,457 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 234 flow. Second operand 3 states and 354 transitions. [2025-03-17 11:13:29,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 282 flow [2025-03-17 11:13:29,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,459 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 225 flow [2025-03-17 11:13:29,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2025-03-17 11:13:29,459 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -11 predicate places. [2025-03-17 11:13:29,460 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 225 flow [2025-03-17 11:13:29,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:29,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,460 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:13:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:29,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -406594472, now seen corresponding path program 1 times [2025-03-17 11:13:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299003466] [2025-03-17 11:13:29,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:13:29,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:13:29,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299003466] [2025-03-17 11:13:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299003466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300131862] [2025-03-17 11:13:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 136 [2025-03-17 11:13:29,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:13:29,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 136 [2025-03-17 11:13:29,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,626 INFO L124 PetriNetUnfolderBase]: 63/396 cut-off events. [2025-03-17 11:13:29,627 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:13:29,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 396 events. 63/396 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1698 event pairs, 47 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 289. Up to 98 conditions per place. [2025-03-17 11:13:29,629 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-17 11:13:29,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 273 flow [2025-03-17 11:13:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-17 11:13:29,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-03-17 11:13:29,630 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 225 flow. Second operand 3 states and 366 transitions. [2025-03-17 11:13:29,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 273 flow [2025-03-17 11:13:29,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,632 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 219 flow [2025-03-17 11:13:29,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2025-03-17 11:13:29,633 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -14 predicate places. [2025-03-17 11:13:29,633 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 219 flow [2025-03-17 11:13:29,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:13:29,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,637 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] [2025-03-17 11:13:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:29,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1047877454, now seen corresponding path program 1 times [2025-03-17 11:13:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720880698] [2025-03-17 11:13:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:13:29,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:13:29,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,717 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:13:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720880698] [2025-03-17 11:13:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720880698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630346262] [2025-03-17 11:13:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 136 [2025-03-17 11:13:29,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:13:29,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 136 [2025-03-17 11:13:29,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,791 INFO L124 PetriNetUnfolderBase]: 55/350 cut-off events. [2025-03-17 11:13:29,791 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-17 11:13:29,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 350 events. 55/350 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1366 event pairs, 23 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 323. Up to 60 conditions per place. [2025-03-17 11:13:29,793 INFO L140 encePairwiseOnDemand]: 131/136 looper letters, 16 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-17 11:13:29,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 263 flow [2025-03-17 11:13:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-17 11:13:29,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-03-17 11:13:29,795 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 219 flow. Second operand 3 states and 366 transitions. [2025-03-17 11:13:29,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 263 flow [2025-03-17 11:13:29,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,796 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 217 flow [2025-03-17 11:13:29,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2025-03-17 11:13:29,797 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -16 predicate places. [2025-03-17 11:13:29,797 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 217 flow [2025-03-17 11:13:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:13:29,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:29,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 910253812, now seen corresponding path program 1 times [2025-03-17 11:13:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23281415] [2025-03-17 11:13:29,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:13:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:13:29,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,834 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:13:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23281415] [2025-03-17 11:13:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23281415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394142146] [2025-03-17 11:13:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2025-03-17 11:13:29,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:13:29,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2025-03-17 11:13:29,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,900 INFO L124 PetriNetUnfolderBase]: 63/351 cut-off events. [2025-03-17 11:13:29,900 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:13:29,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 351 events. 63/351 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1363 event pairs, 47 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 232. Up to 99 conditions per place. [2025-03-17 11:13:29,902 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 19 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2025-03-17 11:13:29,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 267 flow [2025-03-17 11:13:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-17 11:13:29,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2025-03-17 11:13:29,903 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 217 flow. Second operand 3 states and 361 transitions. [2025-03-17 11:13:29,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 267 flow [2025-03-17 11:13:29,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,906 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 213 flow [2025-03-17 11:13:29,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2025-03-17 11:13:29,906 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -17 predicate places. [2025-03-17 11:13:29,906 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 213 flow [2025-03-17 11:13:29,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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:13:29,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:29,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:29,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:29,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1558465151, now seen corresponding path program 1 times [2025-03-17 11:13:29,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182524957] [2025-03-17 11:13:29,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 11:13:29,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 11:13:29,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,973 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:13:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182524957] [2025-03-17 11:13:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182524957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297028523] [2025-03-17 11:13:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 136 [2025-03-17 11:13:29,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:13:29,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 136 [2025-03-17 11:13:29,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,041 INFO L124 PetriNetUnfolderBase]: 63/320 cut-off events. [2025-03-17 11:13:30,041 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:13:30,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 320 events. 63/320 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1171 event pairs, 47 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 260. Up to 98 conditions per place. [2025-03-17 11:13:30,043 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-03-17 11:13:30,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 261 flow [2025-03-17 11:13:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-17 11:13:30,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-03-17 11:13:30,045 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 213 flow. Second operand 3 states and 366 transitions. [2025-03-17 11:13:30,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 261 flow [2025-03-17 11:13:30,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,048 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 211 flow [2025-03-17 11:13:30,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2025-03-17 11:13:30,049 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -18 predicate places. [2025-03-17 11:13:30,049 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 211 flow [2025-03-17 11:13:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:13:30,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,050 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] [2025-03-17 11:13:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:30,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread3Err7ASSERT_VIOLATIONDATA_RACE, thread3Err6ASSERT_VIOLATIONDATA_RACE, thread3Err5ASSERT_VIOLATIONDATA_RACE, thread3Err4ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-17 11:13:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1257171203, now seen corresponding path program 1 times [2025-03-17 11:13:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133458573] [2025-03-17 11:13:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:13:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:13:30,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:30,116 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:13:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133458573] [2025-03-17 11:13:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133458573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543884573] [2025-03-17 11:13:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:30,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:30,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:30,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:30,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2025-03-17 11:13:30,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:30,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:30,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2025-03-17 11:13:30,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,187 INFO L124 PetriNetUnfolderBase]: 63/289 cut-off events. [2025-03-17 11:13:30,187 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:13:30,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 289 events. 63/289 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1020 event pairs, 47 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 272. Up to 99 conditions per place. [2025-03-17 11:13:30,188 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 0 selfloop transitions, 0 changer transitions 104/104 dead transitions. [2025-03-17 11:13:30,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 261 flow [2025-03-17 11:13:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-17 11:13:30,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2025-03-17 11:13:30,190 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 211 flow. Second operand 3 states and 361 transitions. [2025-03-17 11:13:30,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 261 flow [2025-03-17 11:13:30,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,191 INFO L231 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2025-03-17 11:13:30,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2025-03-17 11:13:30,191 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -19 predicate places. [2025-03-17 11:13:30,191 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 0 transitions, 0 flow [2025-03-17 11:13:30,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:13:30,193 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-17 11:13:30,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-17 11:13:30,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-17 11:13:30,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:30,196 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:30,200 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:30,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:30,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:30 BasicIcfg [2025-03-17 11:13:30,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:30,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:30,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:30,205 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:30,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:28" (3/4) ... [2025-03-17 11:13:30,207 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:30,208 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:30,209 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:30,209 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:13:30,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 11:13:30,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:13:30,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:13:30,212 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:30,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:30,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:30,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:30,261 INFO L158 Benchmark]: Toolchain (without parser) took 2265.20ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.20ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.7MB in the end (delta: 496.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: IcfgBuilder took 331.34ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.5MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,262 INFO L158 Benchmark]: TraceAbstraction took 1648.09ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 95.7MB in the end (delta: -19.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,263 INFO L158 Benchmark]: Witness Printer took 55.79ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:30,264 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.20ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.7MB in the end (delta: 496.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.96ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.7MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 331.34ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 76.5MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1648.09ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 95.7MB in the end (delta: -19.8MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 55.79ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 90.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 190 locations, 191 edges, 23 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: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 84 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=0, InterpolantAutomatonStates: 24, 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.4s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:30,279 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