./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:41:11,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:41:11,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:41:11,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:41:11,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:41:12,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:41:12,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:41:12,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:41:12,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:41:12,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:41:12,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:41:12,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:41:12,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:12,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:41:12,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:41:12,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:41:12,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:41:12,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:41:12,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:41:12,016 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb07434636f33664cc09ed992a41516efeea5f96121c916fb8904844e76d9fcd [2025-02-08 05:41:12,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:41:12,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:41:12,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:41:12,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:41:12,240 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:41:12,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-02-08 05:41:13,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5d94063b/b9f83ac5c7bf4c50957cda74879cbd29/FLAGe32968fbc [2025-02-08 05:41:13,624 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:41:13,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/unroll-4.wvr.c [2025-02-08 05:41:13,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5d94063b/b9f83ac5c7bf4c50957cda74879cbd29/FLAGe32968fbc [2025-02-08 05:41:13,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5d94063b/b9f83ac5c7bf4c50957cda74879cbd29 [2025-02-08 05:41:13,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:41:13,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:41:13,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:13,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:41:13,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:41:13,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:13" (1/1) ... [2025-02-08 05:41:13,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa6c45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:13, skipping insertion in model container [2025-02-08 05:41:13,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:13" (1/1) ... [2025-02-08 05:41:13,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:41:14,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:14,112 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:41:14,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:14,154 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:41:14,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14 WrapperNode [2025-02-08 05:41:14,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:14,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:14,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:41:14,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:41:14,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,201 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 292 [2025-02-08 05:41:14,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:14,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:41:14,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:41:14,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:41:14,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:41:14,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:41:14,240 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:41:14,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:41:14,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (1/1) ... [2025-02-08 05:41:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:41:14,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:41:14,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:41:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:41:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:41:14,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:41:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:41:14,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:41:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:41:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:41:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:41:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:41:14,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:41:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:41:14,292 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:41:14,369 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:41:14,370 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:41:14,756 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:41:14,756 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:41:14,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:41:14,773 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:41:14,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:14 BoogieIcfgContainer [2025-02-08 05:41:14,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:41:14,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:41:14,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:41:14,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:41:14,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:41:13" (1/3) ... [2025-02-08 05:41:14,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c3df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:14, skipping insertion in model container [2025-02-08 05:41:14,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:14" (2/3) ... [2025-02-08 05:41:14,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c3df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:14, skipping insertion in model container [2025-02-08 05:41:14,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:14" (3/3) ... [2025-02-08 05:41:14,781 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2025-02-08 05:41:14,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:41:14,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-4.wvr.c that has 3 procedures, 374 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-02-08 05:41:14,793 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:41:14,899 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:41:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 380 places, 393 transitions, 800 flow [2025-02-08 05:41:15,040 INFO L124 PetriNetUnfolderBase]: 20/391 cut-off events. [2025-02-08 05:41:15,041 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:41:15,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 391 events. 20/391 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 536 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 255. Up to 2 conditions per place. [2025-02-08 05:41:15,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 380 places, 393 transitions, 800 flow [2025-02-08 05:41:15,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 374 transitions, 760 flow [2025-02-08 05:41:15,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:41:15,073 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;@70fffeab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:41:15,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2025-02-08 05:41:15,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:41:15,078 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-02-08 05:41:15,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:41:15,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:15,078 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] [2025-02-08 05:41:15,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 322595999, now seen corresponding path program 1 times [2025-02-08 05:41:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338174287] [2025-02-08 05:41:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:15,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:41:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:41:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:15,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-02-08 05:41:15,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338174287] [2025-02-08 05:41:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338174287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:15,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:15,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348507625] [2025-02-08 05:41:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:15,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:15,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:15,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:15,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-02-08 05:41:15,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 374 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:15,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-02-08 05:41:15,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:15,337 INFO L124 PetriNetUnfolderBase]: 15/470 cut-off events. [2025-02-08 05:41:15,337 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:41:15,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 470 events. 15/470 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1092 event pairs, 3 based on Foata normal form. 11/397 useless extension candidates. Maximal degree in co-relation 365. Up to 19 conditions per place. [2025-02-08 05:41:15,344 INFO L140 encePairwiseOnDemand]: 379/393 looper letters, 10 selfloop transitions, 2 changer transitions 4/362 dead transitions. [2025-02-08 05:41:15,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 362 transitions, 760 flow [2025-02-08 05:41:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2025-02-08 05:41:15,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516539440203562 [2025-02-08 05:41:15,357 INFO L175 Difference]: Start difference. First operand has 362 places, 374 transitions, 760 flow. Second operand 3 states and 1122 transitions. [2025-02-08 05:41:15,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 362 transitions, 760 flow [2025-02-08 05:41:15,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 362 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:41:15,367 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2025-02-08 05:41:15,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2025-02-08 05:41:15,371 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2025-02-08 05:41:15,371 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2025-02-08 05:41:15,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:15,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:15,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:41:15,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:15,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1058557476, now seen corresponding path program 1 times [2025-02-08 05:41:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:15,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930855615] [2025-02-08 05:41:15,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:15,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:41:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:41:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:15,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930855615] [2025-02-08 05:41:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930855615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:15,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744399028] [2025-02-08 05:41:15,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:15,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:15,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:15,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 393 [2025-02-08 05:41:15,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:15,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 393 [2025-02-08 05:41:15,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:15,568 INFO L124 PetriNetUnfolderBase]: 22/558 cut-off events. [2025-02-08 05:41:15,568 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:41:15,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 558 events. 22/558 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1423 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 572. Up to 33 conditions per place. [2025-02-08 05:41:15,572 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-02-08 05:41:15,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 754 flow [2025-02-08 05:41:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:41:15,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355385920271416 [2025-02-08 05:41:15,575 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:41:15,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 754 flow [2025-02-08 05:41:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:15,580 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 722 flow [2025-02-08 05:41:15,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2025-02-08 05:41:15,581 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -8 predicate places. [2025-02-08 05:41:15,581 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 722 flow [2025-02-08 05:41:15,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:15,582 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] [2025-02-08 05:41:15,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:41:15,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1057003829, now seen corresponding path program 1 times [2025-02-08 05:41:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000015933] [2025-02-08 05:41:15,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:15,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:41:15,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:41:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:15,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000015933] [2025-02-08 05:41:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000015933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581328698] [2025-02-08 05:41:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:15,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:15,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:15,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:15,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:15,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 393 [2025-02-08 05:41:15,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:15,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 393 [2025-02-08 05:41:15,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:15,816 INFO L124 PetriNetUnfolderBase]: 79/1186 cut-off events. [2025-02-08 05:41:15,816 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:41:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1293 conditions, 1186 events. 79/1186 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5235 event pairs, 26 based on Foata normal form. 0/968 useless extension candidates. Maximal degree in co-relation 1257. Up to 97 conditions per place. [2025-02-08 05:41:15,825 INFO L140 encePairwiseOnDemand]: 385/393 looper letters, 18 selfloop transitions, 1 changer transitions 0/350 dead transitions. [2025-02-08 05:41:15,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 350 transitions, 746 flow [2025-02-08 05:41:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2025-02-08 05:41:15,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228159457167091 [2025-02-08 05:41:15,829 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 722 flow. Second operand 3 states and 1088 transitions. [2025-02-08 05:41:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 350 transitions, 746 flow [2025-02-08 05:41:15,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:15,833 INFO L231 Difference]: Finished difference. Result has 347 places, 350 transitions, 706 flow [2025-02-08 05:41:15,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=347, PETRI_TRANSITIONS=350} [2025-02-08 05:41:15,834 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -15 predicate places. [2025-02-08 05:41:15,834 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 350 transitions, 706 flow [2025-02-08 05:41:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:15,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:15,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:41:15,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:15,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -206897956, now seen corresponding path program 1 times [2025-02-08 05:41:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826938747] [2025-02-08 05:41:15,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:15,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:41:15,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:41:15,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:15,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826938747] [2025-02-08 05:41:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826938747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:15,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619181835] [2025-02-08 05:41:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:15,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:15,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:15,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:15,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 393 [2025-02-08 05:41:15,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 350 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:15,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:15,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 393 [2025-02-08 05:41:15,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:16,029 INFO L124 PetriNetUnfolderBase]: 22/546 cut-off events. [2025-02-08 05:41:16,030 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:41:16,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 546 events. 22/546 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1380 event pairs, 9 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 549. Up to 31 conditions per place. [2025-02-08 05:41:16,034 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 12 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-02-08 05:41:16,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 349 transitions, 732 flow [2025-02-08 05:41:16,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-08 05:41:16,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9389312977099237 [2025-02-08 05:41:16,037 INFO L175 Difference]: Start difference. First operand has 347 places, 350 transitions, 706 flow. Second operand 3 states and 1107 transitions. [2025-02-08 05:41:16,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 349 transitions, 732 flow [2025-02-08 05:41:16,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 349 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:16,041 INFO L231 Difference]: Finished difference. Result has 347 places, 349 transitions, 707 flow [2025-02-08 05:41:16,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=707, PETRI_PLACES=347, PETRI_TRANSITIONS=349} [2025-02-08 05:41:16,042 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -15 predicate places. [2025-02-08 05:41:16,043 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 349 transitions, 707 flow [2025-02-08 05:41:16,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:16,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:16,044 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] [2025-02-08 05:41:16,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:41:16,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1594318908, now seen corresponding path program 1 times [2025-02-08 05:41:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311743760] [2025-02-08 05:41:16,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:41:16,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:41:16,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311743760] [2025-02-08 05:41:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311743760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:16,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:16,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921184504] [2025-02-08 05:41:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:16,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:16,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:16,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:16,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 393 [2025-02-08 05:41:16,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 349 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:16,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:16,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 393 [2025-02-08 05:41:16,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:16,767 INFO L124 PetriNetUnfolderBase]: 154/1466 cut-off events. [2025-02-08 05:41:16,767 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:41:16,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 1466 events. 154/1466 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7317 event pairs, 84 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1687. Up to 240 conditions per place. [2025-02-08 05:41:16,775 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 32 selfloop transitions, 5 changer transitions 0/348 dead transitions. [2025-02-08 05:41:16,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 348 transitions, 779 flow [2025-02-08 05:41:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2090 transitions. [2025-02-08 05:41:16,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863443596268024 [2025-02-08 05:41:16,779 INFO L175 Difference]: Start difference. First operand has 347 places, 349 transitions, 707 flow. Second operand 6 states and 2090 transitions. [2025-02-08 05:41:16,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 348 transitions, 779 flow [2025-02-08 05:41:16,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 348 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:16,783 INFO L231 Difference]: Finished difference. Result has 349 places, 348 transitions, 711 flow [2025-02-08 05:41:16,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=349, PETRI_TRANSITIONS=348} [2025-02-08 05:41:16,785 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -13 predicate places. [2025-02-08 05:41:16,786 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 348 transitions, 711 flow [2025-02-08 05:41:16,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 343.5) internal successors, (2061), 6 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:16,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:16,787 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] [2025-02-08 05:41:16,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:41:16,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:16,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:16,788 INFO L85 PathProgramCache]: Analyzing trace with hash -86427330, now seen corresponding path program 1 times [2025-02-08 05:41:16,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072977354] [2025-02-08 05:41:16,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:16,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:41:16,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:41:16,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:16,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072977354] [2025-02-08 05:41:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072977354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:16,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:16,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:16,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869688145] [2025-02-08 05:41:16,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:16,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:16,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:16,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-02-08 05:41:16,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 348 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:16,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:16,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-02-08 05:41:16,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:16,944 INFO L124 PetriNetUnfolderBase]: 36/989 cut-off events. [2025-02-08 05:41:16,944 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:41:16,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 989 events. 36/989 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4019 event pairs, 8 based on Foata normal form. 0/824 useless extension candidates. Maximal degree in co-relation 1017. Up to 32 conditions per place. [2025-02-08 05:41:16,949 INFO L140 encePairwiseOnDemand]: 389/393 looper letters, 10 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2025-02-08 05:41:16,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 727 flow [2025-02-08 05:41:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1112 transitions. [2025-02-08 05:41:16,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9431721798134012 [2025-02-08 05:41:16,952 INFO L175 Difference]: Start difference. First operand has 349 places, 348 transitions, 711 flow. Second operand 3 states and 1112 transitions. [2025-02-08 05:41:16,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 727 flow [2025-02-08 05:41:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 345 transitions, 717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:16,957 INFO L231 Difference]: Finished difference. Result has 343 places, 345 transitions, 697 flow [2025-02-08 05:41:16,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=345} [2025-02-08 05:41:16,959 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -19 predicate places. [2025-02-08 05:41:16,960 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 345 transitions, 697 flow [2025-02-08 05:41:16,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:16,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:16,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:41:16,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -769828247, now seen corresponding path program 1 times [2025-02-08 05:41:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696605386] [2025-02-08 05:41:16,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:41:16,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:41:16,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696605386] [2025-02-08 05:41:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696605386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258786799] [2025-02-08 05:41:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:17,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:17,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:17,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:17,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 393 [2025-02-08 05:41:17,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 345 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:17,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 393 [2025-02-08 05:41:17,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:17,065 INFO L124 PetriNetUnfolderBase]: 21/563 cut-off events. [2025-02-08 05:41:17,065 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:41:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 563 events. 21/563 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1139 event pairs, 1 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 569. Up to 20 conditions per place. [2025-02-08 05:41:17,069 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 11 selfloop transitions, 3 changer transitions 0/342 dead transitions. [2025-02-08 05:41:17,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 342 transitions, 720 flow [2025-02-08 05:41:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-08 05:41:17,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9389312977099237 [2025-02-08 05:41:17,071 INFO L175 Difference]: Start difference. First operand has 343 places, 345 transitions, 697 flow. Second operand 3 states and 1107 transitions. [2025-02-08 05:41:17,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 342 transitions, 720 flow [2025-02-08 05:41:17,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 342 transitions, 719 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:17,075 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 694 flow [2025-02-08 05:41:17,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2025-02-08 05:41:17,075 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2025-02-08 05:41:17,076 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 694 flow [2025-02-08 05:41:17,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:17,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:17,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:41:17,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1519973659, now seen corresponding path program 1 times [2025-02-08 05:41:17,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:17,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056576910] [2025-02-08 05:41:17,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:17,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:17,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 05:41:17,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 05:41:17,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:17,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056576910] [2025-02-08 05:41:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056576910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519280419] [2025-02-08 05:41:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:17,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:17,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:17,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 393 [2025-02-08 05:41:17,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:17,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 393 [2025-02-08 05:41:17,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:17,234 INFO L124 PetriNetUnfolderBase]: 40/488 cut-off events. [2025-02-08 05:41:17,234 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-08 05:41:17,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 488 events. 40/488 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1383 event pairs, 4 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 552. Up to 73 conditions per place. [2025-02-08 05:41:17,237 INFO L140 encePairwiseOnDemand]: 371/393 looper letters, 24 selfloop transitions, 8 changer transitions 4/329 dead transitions. [2025-02-08 05:41:17,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 739 flow [2025-02-08 05:41:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-02-08 05:41:17,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8871925360474979 [2025-02-08 05:41:17,242 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 694 flow. Second operand 3 states and 1046 transitions. [2025-02-08 05:41:17,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 739 flow [2025-02-08 05:41:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:17,247 INFO L231 Difference]: Finished difference. Result has 327 places, 324 transitions, 669 flow [2025-02-08 05:41:17,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=327, PETRI_TRANSITIONS=324} [2025-02-08 05:41:17,249 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2025-02-08 05:41:17,250 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 324 transitions, 669 flow [2025-02-08 05:41:17,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:17,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:17,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:41:17,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:17,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 234002653, now seen corresponding path program 1 times [2025-02-08 05:41:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728766479] [2025-02-08 05:41:17,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:17,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:41:17,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:41:17,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728766479] [2025-02-08 05:41:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728766479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945508688] [2025-02-08 05:41:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:17,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:17,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:17,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:17,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 393 [2025-02-08 05:41:17,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 324 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:17,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 393 [2025-02-08 05:41:17,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:17,384 INFO L124 PetriNetUnfolderBase]: 71/991 cut-off events. [2025-02-08 05:41:17,385 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:41:17,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 991 events. 71/991 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3930 event pairs, 8 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1088. Up to 86 conditions per place. [2025-02-08 05:41:17,391 INFO L140 encePairwiseOnDemand]: 386/393 looper letters, 16 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:41:17,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 705 flow [2025-02-08 05:41:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-08 05:41:17,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355385920271416 [2025-02-08 05:41:17,394 INFO L175 Difference]: Start difference. First operand has 327 places, 324 transitions, 669 flow. Second operand 3 states and 1103 transitions. [2025-02-08 05:41:17,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 705 flow [2025-02-08 05:41:17,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:17,400 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 657 flow [2025-02-08 05:41:17,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2025-02-08 05:41:17,402 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -43 predicate places. [2025-02-08 05:41:17,402 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 657 flow [2025-02-08 05:41:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:17,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:17,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:41:17,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:17,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:17,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1005381057, now seen corresponding path program 1 times [2025-02-08 05:41:17,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364428363] [2025-02-08 05:41:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:17,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:41:17,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:41:17,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:17,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364428363] [2025-02-08 05:41:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364428363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:41:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401439047] [2025-02-08 05:41:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:41:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:17,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:41:17,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:41:17,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 393 [2025-02-08 05:41:17,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 657 flow. Second operand has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:17,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 393 [2025-02-08 05:41:17,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:17,639 INFO L124 PetriNetUnfolderBase]: 44/1153 cut-off events. [2025-02-08 05:41:17,639 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:41:17,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 1153 events. 44/1153 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4419 event pairs, 3 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 1188. Up to 18 conditions per place. [2025-02-08 05:41:17,646 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 13 selfloop transitions, 6 changer transitions 0/330 dead transitions. [2025-02-08 05:41:17,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 330 transitions, 717 flow [2025-02-08 05:41:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:41:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:41:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1865 transitions. [2025-02-08 05:41:17,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2025-02-08 05:41:17,649 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 657 flow. Second operand 5 states and 1865 transitions. [2025-02-08 05:41:17,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 330 transitions, 717 flow [2025-02-08 05:41:17,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 330 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:17,653 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 695 flow [2025-02-08 05:41:17,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=695, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2025-02-08 05:41:17,654 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2025-02-08 05:41:17,654 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 695 flow [2025-02-08 05:41:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 370.25) internal successors, (1481), 4 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:17,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:17,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:41:17,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 233309679, now seen corresponding path program 1 times [2025-02-08 05:41:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658640889] [2025-02-08 05:41:17,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 05:41:17,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 05:41:17,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:17,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658640889] [2025-02-08 05:41:18,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658640889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:18,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:18,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912497911] [2025-02-08 05:41:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:18,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:18,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:18,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 393 [2025-02-08 05:41:18,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 695 flow. Second operand has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:18,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 393 [2025-02-08 05:41:18,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:18,397 INFO L124 PetriNetUnfolderBase]: 38/895 cut-off events. [2025-02-08 05:41:18,397 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-02-08 05:41:18,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 895 events. 38/895 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2811 event pairs, 2 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 951. Up to 17 conditions per place. [2025-02-08 05:41:18,404 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 15 selfloop transitions, 6 changer transitions 0/328 dead transitions. [2025-02-08 05:41:18,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 328 transitions, 747 flow [2025-02-08 05:41:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2193 transitions. [2025-02-08 05:41:18,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300254452926209 [2025-02-08 05:41:18,408 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 695 flow. Second operand 6 states and 2193 transitions. [2025-02-08 05:41:18,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 328 transitions, 747 flow [2025-02-08 05:41:18,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 328 transitions, 747 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:18,412 INFO L231 Difference]: Finished difference. Result has 330 places, 324 transitions, 705 flow [2025-02-08 05:41:18,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=705, PETRI_PLACES=330, PETRI_TRANSITIONS=324} [2025-02-08 05:41:18,413 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -32 predicate places. [2025-02-08 05:41:18,413 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 324 transitions, 705 flow [2025-02-08 05:41:18,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 363.5) internal successors, (2181), 6 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:18,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:18,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:41:18,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:18,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1931242012, now seen corresponding path program 1 times [2025-02-08 05:41:18,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:18,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894466976] [2025-02-08 05:41:18,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:18,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:41:18,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:41:18,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:18,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894466976] [2025-02-08 05:41:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894466976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:41:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231464661] [2025-02-08 05:41:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:41:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:41:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:41:18,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 393 [2025-02-08 05:41:18,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 324 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:18,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 393 [2025-02-08 05:41:18,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:18,684 INFO L124 PetriNetUnfolderBase]: 56/1124 cut-off events. [2025-02-08 05:41:18,684 INFO L125 PetriNetUnfolderBase]: For 34/35 co-relation queries the response was YES. [2025-02-08 05:41:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1124 events. 56/1124 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4904 event pairs, 6 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 1226. Up to 60 conditions per place. [2025-02-08 05:41:18,691 INFO L140 encePairwiseOnDemand]: 387/393 looper letters, 15 selfloop transitions, 6 changer transitions 0/332 dead transitions. [2025-02-08 05:41:18,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 766 flow [2025-02-08 05:41:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:41:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:41:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1852 transitions. [2025-02-08 05:41:18,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424936386768448 [2025-02-08 05:41:18,694 INFO L175 Difference]: Start difference. First operand has 330 places, 324 transitions, 705 flow. Second operand 5 states and 1852 transitions. [2025-02-08 05:41:18,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 766 flow [2025-02-08 05:41:18,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:18,698 INFO L231 Difference]: Finished difference. Result has 332 places, 328 transitions, 731 flow [2025-02-08 05:41:18,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=731, PETRI_PLACES=332, PETRI_TRANSITIONS=328} [2025-02-08 05:41:18,699 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2025-02-08 05:41:18,699 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 328 transitions, 731 flow [2025-02-08 05:41:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 367.5) internal successors, (1470), 4 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:18,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:18,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:41:18,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 788257201, now seen corresponding path program 1 times [2025-02-08 05:41:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457717759] [2025-02-08 05:41:18,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:18,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-08 05:41:18,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-08 05:41:18,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:18,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457717759] [2025-02-08 05:41:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457717759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310132900] [2025-02-08 05:41:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:18,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:18,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:18,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 393 [2025-02-08 05:41:18,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 328 transitions, 731 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:18,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 393 [2025-02-08 05:41:18,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:18,870 INFO L124 PetriNetUnfolderBase]: 51/1450 cut-off events. [2025-02-08 05:41:18,871 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 05:41:18,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1450 events. 51/1450 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 6574 event pairs, 10 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 1590. Up to 34 conditions per place. [2025-02-08 05:41:18,882 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 9 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-02-08 05:41:18,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 754 flow [2025-02-08 05:41:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-02-08 05:41:18,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2025-02-08 05:41:18,885 INFO L175 Difference]: Start difference. First operand has 332 places, 328 transitions, 731 flow. Second operand 3 states and 1113 transitions. [2025-02-08 05:41:18,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 328 transitions, 754 flow [2025-02-08 05:41:18,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 328 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:18,889 INFO L231 Difference]: Finished difference. Result has 333 places, 327 transitions, 733 flow [2025-02-08 05:41:18,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=333, PETRI_TRANSITIONS=327} [2025-02-08 05:41:18,891 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -29 predicate places. [2025-02-08 05:41:18,891 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 327 transitions, 733 flow [2025-02-08 05:41:18,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:18,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:18,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:18,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:41:18,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:18,893 INFO L85 PathProgramCache]: Analyzing trace with hash -634067733, now seen corresponding path program 1 times [2025-02-08 05:41:18,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:18,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719520187] [2025-02-08 05:41:18,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 05:41:18,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 05:41:18,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:18,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:19,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:19,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719520187] [2025-02-08 05:41:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719520187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:19,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:41:19,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43767360] [2025-02-08 05:41:19,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:19,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:41:19,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:19,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:41:19,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:41:19,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 393 [2025-02-08 05:41:19,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 327 transitions, 733 flow. Second operand has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:19,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 393 [2025-02-08 05:41:19,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:19,534 INFO L124 PetriNetUnfolderBase]: 86/976 cut-off events. [2025-02-08 05:41:19,535 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2025-02-08 05:41:19,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 976 events. 86/976 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4682 event pairs, 10 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 1235. Up to 70 conditions per place. [2025-02-08 05:41:19,541 INFO L140 encePairwiseOnDemand]: 369/393 looper letters, 18 selfloop transitions, 21 changer transitions 0/327 dead transitions. [2025-02-08 05:41:19,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 815 flow [2025-02-08 05:41:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:41:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:41:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2088 transitions. [2025-02-08 05:41:19,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8854961832061069 [2025-02-08 05:41:19,546 INFO L175 Difference]: Start difference. First operand has 333 places, 327 transitions, 733 flow. Second operand 6 states and 2088 transitions. [2025-02-08 05:41:19,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 327 transitions, 815 flow [2025-02-08 05:41:19,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 327 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:19,550 INFO L231 Difference]: Finished difference. Result has 332 places, 323 transitions, 763 flow [2025-02-08 05:41:19,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=332, PETRI_TRANSITIONS=323} [2025-02-08 05:41:19,551 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -30 predicate places. [2025-02-08 05:41:19,551 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 323 transitions, 763 flow [2025-02-08 05:41:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.6666666666667) internal successors, (2056), 6 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:19,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:19,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:41:19,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:19,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1000517741, now seen corresponding path program 1 times [2025-02-08 05:41:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392644540] [2025-02-08 05:41:19,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:19,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:41:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:41:19,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:19,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392644540] [2025-02-08 05:41:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392644540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799759690] [2025-02-08 05:41:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:19,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:19,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:19,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-02-08 05:41:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 323 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:19,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-02-08 05:41:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:19,743 INFO L124 PetriNetUnfolderBase]: 76/1111 cut-off events. [2025-02-08 05:41:19,743 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2025-02-08 05:41:19,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1111 events. 76/1111 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5232 event pairs, 42 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1436. Up to 142 conditions per place. [2025-02-08 05:41:19,749 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:41:19,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 323 transitions, 810 flow [2025-02-08 05:41:19,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-02-08 05:41:19,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-02-08 05:41:19,752 INFO L175 Difference]: Start difference. First operand has 332 places, 323 transitions, 763 flow. Second operand 3 states and 1089 transitions. [2025-02-08 05:41:19,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 323 transitions, 810 flow [2025-02-08 05:41:19,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 323 transitions, 768 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:41:19,757 INFO L231 Difference]: Finished difference. Result has 328 places, 322 transitions, 723 flow [2025-02-08 05:41:19,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=328, PETRI_TRANSITIONS=322} [2025-02-08 05:41:19,758 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -34 predicate places. [2025-02-08 05:41:19,758 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 322 transitions, 723 flow [2025-02-08 05:41:19,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:19,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:19,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:41:19,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:19,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1988417985, now seen corresponding path program 1 times [2025-02-08 05:41:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141411079] [2025-02-08 05:41:19,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:19,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-08 05:41:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-08 05:41:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141411079] [2025-02-08 05:41:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141411079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:19,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174763385] [2025-02-08 05:41:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:19,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:19,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:19,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:19,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-02-08 05:41:19,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 322 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:19,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-02-08 05:41:19,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:19,982 INFO L124 PetriNetUnfolderBase]: 75/1074 cut-off events. [2025-02-08 05:41:19,982 INFO L125 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2025-02-08 05:41:19,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1074 events. 75/1074 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5007 event pairs, 42 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1289. Up to 142 conditions per place. [2025-02-08 05:41:19,989 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-08 05:41:19,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 322 transitions, 770 flow [2025-02-08 05:41:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-02-08 05:41:19,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-02-08 05:41:19,992 INFO L175 Difference]: Start difference. First operand has 328 places, 322 transitions, 723 flow. Second operand 3 states and 1089 transitions. [2025-02-08 05:41:19,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 322 transitions, 770 flow [2025-02-08 05:41:19,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 322 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:19,996 INFO L231 Difference]: Finished difference. Result has 327 places, 321 transitions, 721 flow [2025-02-08 05:41:19,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=327, PETRI_TRANSITIONS=321} [2025-02-08 05:41:19,997 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -35 predicate places. [2025-02-08 05:41:19,998 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 321 transitions, 721 flow [2025-02-08 05:41:19,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:19,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:19,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:41:19,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:20,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1112005515, now seen corresponding path program 1 times [2025-02-08 05:41:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966983301] [2025-02-08 05:41:20,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:20,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 05:41:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 05:41:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:20,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:20,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966983301] [2025-02-08 05:41:20,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966983301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:20,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935783000] [2025-02-08 05:41:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:20,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:20,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:20,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:20,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-02-08 05:41:20,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 321 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:20,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:20,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-02-08 05:41:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:20,212 INFO L124 PetriNetUnfolderBase]: 74/1036 cut-off events. [2025-02-08 05:41:20,212 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2025-02-08 05:41:20,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 1036 events. 74/1036 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4723 event pairs, 42 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1250. Up to 142 conditions per place. [2025-02-08 05:41:20,219 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 21 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-08 05:41:20,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 321 transitions, 768 flow [2025-02-08 05:41:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-02-08 05:41:20,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-02-08 05:41:20,221 INFO L175 Difference]: Start difference. First operand has 327 places, 321 transitions, 721 flow. Second operand 3 states and 1089 transitions. [2025-02-08 05:41:20,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 321 transitions, 768 flow [2025-02-08 05:41:20,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 321 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:20,225 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 719 flow [2025-02-08 05:41:20,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2025-02-08 05:41:20,226 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2025-02-08 05:41:20,226 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 719 flow [2025-02-08 05:41:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:20,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:20,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:41:20,227 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 81 more)] === [2025-02-08 05:41:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1184360585, now seen corresponding path program 1 times [2025-02-08 05:41:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027309626] [2025-02-08 05:41:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:20,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-08 05:41:20,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-08 05:41:20,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:20,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:20,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027309626] [2025-02-08 05:41:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027309626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345571860] [2025-02-08 05:41:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:20,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:20,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:20,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 393 [2025-02-08 05:41:20,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:20,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:20,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 393 [2025-02-08 05:41:20,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:20,432 INFO L124 PetriNetUnfolderBase]: 73/998 cut-off events. [2025-02-08 05:41:20,432 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2025-02-08 05:41:20,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 998 events. 73/998 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4506 event pairs, 42 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 1212. Up to 142 conditions per place. [2025-02-08 05:41:20,437 INFO L140 encePairwiseOnDemand]: 390/393 looper letters, 0 selfloop transitions, 0 changer transitions 320/320 dead transitions. [2025-02-08 05:41:20,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 320 transitions, 766 flow [2025-02-08 05:41:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2025-02-08 05:41:20,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2025-02-08 05:41:20,439 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 719 flow. Second operand 3 states and 1089 transitions. [2025-02-08 05:41:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 320 transitions, 766 flow [2025-02-08 05:41:20,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 320 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:20,442 INFO L231 Difference]: Finished difference. Result has 325 places, 0 transitions, 0 flow [2025-02-08 05:41:20,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=393, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=325, PETRI_TRANSITIONS=0} [2025-02-08 05:41:20,443 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -37 predicate places. [2025-02-08 05:41:20,443 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 0 transitions, 0 flow [2025-02-08 05:41:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:20,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 85 remaining) [2025-02-08 05:41:20,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (83 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (80 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (79 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (77 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (76 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (75 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (74 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (73 of 85 remaining) [2025-02-08 05:41:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (72 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (71 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (70 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (68 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (67 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (65 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (64 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (63 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (62 of 85 remaining) [2025-02-08 05:41:20,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (61 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (60 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (57 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (56 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (55 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 85 remaining) [2025-02-08 05:41:20,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (52 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (49 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (45 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 85 remaining) [2025-02-08 05:41:20,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (34 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (28 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (27 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (26 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (25 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (24 of 85 remaining) [2025-02-08 05:41:20,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 85 remaining) [2025-02-08 05:41:20,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 85 remaining) [2025-02-08 05:41:20,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 85 remaining) [2025-02-08 05:41:20,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:41:20,453 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:20,459 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:41:20,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:41:20,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:41:20 BasicIcfg [2025-02-08 05:41:20,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:41:20,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:41:20,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:41:20,467 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:41:20,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:14" (3/4) ... [2025-02-08 05:41:20,469 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:41:20,472 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:41:20,472 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:41:20,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-02-08 05:41:20,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:41:20,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:41:20,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:41:20,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:41:20,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:41:20,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:41:20,544 INFO L158 Benchmark]: Toolchain (without parser) took 6589.17ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 113.8MB in the beginning and 124.7MB in the end (delta: -10.9MB). Peak memory consumption was 123.9MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,545 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:20,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.45ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,546 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:20,546 INFO L158 Benchmark]: IcfgBuilder took 534.12ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 67.0MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,546 INFO L158 Benchmark]: TraceAbstraction took 5689.77ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 66.5MB in the beginning and 133.1MB in the end (delta: -66.6MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,546 INFO L158 Benchmark]: Witness Printer took 76.85ms. Allocated memory is still 276.8MB. Free memory was 133.1MB in the beginning and 124.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:20,547 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.45ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 534.12ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 67.0MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5689.77ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 66.5MB in the beginning and 133.1MB in the end (delta: -66.6MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. * Witness Printer took 76.85ms. Allocated memory is still 276.8MB. Free memory was 133.1MB in the beginning and 124.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 67]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: 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 5 procedures, 609 locations, 85 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1437 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1573 IncrementalHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 120 mSDtfsCounter, 1573 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=14, InterpolantAutomatonStates: 67, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1845 NumberOfCodeBlocks, 1845 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:41:20,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE