./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:12:13,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:12:13,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:12:13,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:12:13,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:12:13,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:12:13,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:12:13,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:12:13,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:12:13,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:12:13,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:12:13,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:12:13,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:12:13,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:13,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:12:13,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:12:13,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:12:13,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:12:13,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:12:13,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:12:13,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7b74cf7a2419cab3ab4545eb4bb4cb738b0dd565da7b17a0ca0e4253475f1b6 [2025-03-17 11:12:14,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:12:14,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:12:14,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:12:14,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:12:14,112 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:12:14,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-03-17 11:12:15,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fba5d0ae/2a4f92853cb54b338c6bf07e868aeed3/FLAG3ae33e13e [2025-03-17 11:12:15,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:12:15,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2025-03-17 11:12:15,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fba5d0ae/2a4f92853cb54b338c6bf07e868aeed3/FLAG3ae33e13e [2025-03-17 11:12:15,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fba5d0ae/2a4f92853cb54b338c6bf07e868aeed3 [2025-03-17 11:12:15,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:12:15,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:12:15,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:15,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:12:15,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:12:15,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5361dfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15, skipping insertion in model container [2025-03-17 11:12:15,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:12:15,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:15,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:12:15,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:15,938 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:12:15,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15 WrapperNode [2025-03-17 11:12:15,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:15,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:15,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:12:15,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:12:15,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,973 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-03-17 11:12:15,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:15,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:12:15,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:12:15,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:12:15,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:16,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:12:16,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:12:16,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:12:16,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:12:16,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:16,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:16,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:12:16,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:12:16,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:12:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:12:16,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:12:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:12:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:12:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:12:16,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:12:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:12:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:12:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:12:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:12:16,051 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:12:16,132 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:12:16,134 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:12:16,413 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:12:16,413 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:12:16,424 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:12:16,424 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:12:16,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:16 BoogieIcfgContainer [2025-03-17 11:12:16,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:12:16,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:12:16,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:12:16,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:12:16,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:12:15" (1/3) ... [2025-03-17 11:12:16,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faadb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:16, skipping insertion in model container [2025-03-17 11:12:16,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (2/3) ... [2025-03-17 11:12:16,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72faadb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:16, skipping insertion in model container [2025-03-17 11:12:16,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:16" (3/3) ... [2025-03-17 11:12:16,431 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-03-17 11:12:16,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:12:16,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 302 locations, 1 initial locations, 0 loop locations, and 27 error locations. [2025-03-17 11:12:16,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:12:16,538 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:12:16,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 316 transitions, 653 flow [2025-03-17 11:12:16,660 INFO L124 PetriNetUnfolderBase]: 15/313 cut-off events. [2025-03-17 11:12:16,662 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:12:16,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 15/313 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 780 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-03-17 11:12:16,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 316 transitions, 653 flow [2025-03-17 11:12:16,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 292 transitions, 602 flow [2025-03-17 11:12:16,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:12:16,699 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;@135750a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:12:16,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2025-03-17 11:12:16,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:12:16,707 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:12:16,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:12:16,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:16,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 79812389, now seen corresponding path program 1 times [2025-03-17 11:12:16,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135712848] [2025-03-17 11:12:16,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:12:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:12:16,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135712848] [2025-03-17 11:12:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135712848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082712086] [2025-03-17 11:12:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-17 11:12:16,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-17 11:12:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,003 INFO L124 PetriNetUnfolderBase]: 18/466 cut-off events. [2025-03-17 11:12:17,004 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:12:17,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 466 events. 18/466 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2047 event pairs, 5 based on Foata normal form. 18/414 useless extension candidates. Maximal degree in co-relation 386. Up to 22 conditions per place. [2025-03-17 11:12:17,010 INFO L140 encePairwiseOnDemand]: 307/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-17 11:12:17,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 285 transitions, 614 flow [2025-03-17 11:12:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2025-03-17 11:12:17,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483122362869199 [2025-03-17 11:12:17,021 INFO L175 Difference]: Start difference. First operand has 289 places, 292 transitions, 602 flow. Second operand 3 states and 899 transitions. [2025-03-17 11:12:17,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 285 transitions, 614 flow [2025-03-17 11:12:17,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 285 transitions, 602 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:12:17,036 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 580 flow [2025-03-17 11:12:17,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2025-03-17 11:12:17,043 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -5 predicate places. [2025-03-17 11:12:17,043 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 580 flow [2025-03-17 11:12:17,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,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] [2025-03-17 11:12:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:12:17,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1744768334, now seen corresponding path program 1 times [2025-03-17 11:12:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102873049] [2025-03-17 11:12:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:12:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:12:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102873049] [2025-03-17 11:12:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102873049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141493057] [2025-03-17 11:12:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-17 11:12:17,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-17 11:12:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,181 INFO L124 PetriNetUnfolderBase]: 16/418 cut-off events. [2025-03-17 11:12:17,181 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:12:17,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 418 events. 16/418 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1692 event pairs, 5 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 417. Up to 22 conditions per place. [2025-03-17 11:12:17,185 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-17 11:12:17,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 284 transitions, 604 flow [2025-03-17 11:12:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-17 11:12:17,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-17 11:12:17,188 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 580 flow. Second operand 3 states and 893 transitions. [2025-03-17 11:12:17,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 284 transitions, 604 flow [2025-03-17 11:12:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 284 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,192 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 578 flow [2025-03-17 11:12:17,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2025-03-17 11:12:17,192 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -6 predicate places. [2025-03-17 11:12:17,193 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 578 flow [2025-03-17 11:12:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:12:17,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1754679343, now seen corresponding path program 1 times [2025-03-17 11:12:17,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142390529] [2025-03-17 11:12:17,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:12:17,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:12:17,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142390529] [2025-03-17 11:12:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142390529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433344443] [2025-03-17 11:12:17,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-03-17 11:12:17,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-03-17 11:12:17,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,361 INFO L124 PetriNetUnfolderBase]: 33/686 cut-off events. [2025-03-17 11:12:17,362 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:12:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 686 events. 33/686 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3728 event pairs, 12 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 695. Up to 35 conditions per place. [2025-03-17 11:12:17,368 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 12 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-17 11:12:17,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 283 transitions, 604 flow [2025-03-17 11:12:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2025-03-17 11:12:17,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.939873417721519 [2025-03-17 11:12:17,370 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 578 flow. Second operand 3 states and 891 transitions. [2025-03-17 11:12:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 283 transitions, 604 flow [2025-03-17 11:12:17,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 283 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,374 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 576 flow [2025-03-17 11:12:17,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2025-03-17 11:12:17,376 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -7 predicate places. [2025-03-17 11:12:17,376 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 576 flow [2025-03-17 11:12:17,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:12:17,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2091246845, now seen corresponding path program 1 times [2025-03-17 11:12:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113481889] [2025-03-17 11:12:17,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:12:17,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:12:17,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113481889] [2025-03-17 11:12:17,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113481889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258249685] [2025-03-17 11:12:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-17 11:12:17,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-17 11:12:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,528 INFO L124 PetriNetUnfolderBase]: 22/541 cut-off events. [2025-03-17 11:12:17,529 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-17 11:12:17,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 541 events. 22/541 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2511 event pairs, 7 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 529. Up to 25 conditions per place. [2025-03-17 11:12:17,533 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-17 11:12:17,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 282 transitions, 600 flow [2025-03-17 11:12:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-17 11:12:17,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-17 11:12:17,536 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 576 flow. Second operand 3 states and 893 transitions. [2025-03-17 11:12:17,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 282 transitions, 600 flow [2025-03-17 11:12:17,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 282 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,540 INFO L231 Difference]: Finished difference. Result has 281 places, 282 transitions, 574 flow [2025-03-17 11:12:17,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=282} [2025-03-17 11:12:17,541 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -8 predicate places. [2025-03-17 11:12:17,542 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 282 transitions, 574 flow [2025-03-17 11:12:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,542 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] [2025-03-17 11:12:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:12:17,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash -957983003, now seen corresponding path program 1 times [2025-03-17 11:12:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867576898] [2025-03-17 11:12:17,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:12:17,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:12:17,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867576898] [2025-03-17 11:12:17,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867576898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889060216] [2025-03-17 11:12:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 316 [2025-03-17 11:12:17,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 282 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 316 [2025-03-17 11:12:17,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,706 INFO L124 PetriNetUnfolderBase]: 43/725 cut-off events. [2025-03-17 11:12:17,706 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-17 11:12:17,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 725 events. 43/725 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3752 event pairs, 20 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 728. Up to 50 conditions per place. [2025-03-17 11:12:17,711 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-17 11:12:17,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 281 transitions, 602 flow [2025-03-17 11:12:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2025-03-17 11:12:17,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9377637130801688 [2025-03-17 11:12:17,717 INFO L175 Difference]: Start difference. First operand has 281 places, 282 transitions, 574 flow. Second operand 3 states and 889 transitions. [2025-03-17 11:12:17,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 281 transitions, 602 flow [2025-03-17 11:12:17,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 281 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,720 INFO L231 Difference]: Finished difference. Result has 280 places, 281 transitions, 572 flow [2025-03-17 11:12:17,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=281} [2025-03-17 11:12:17,720 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-17 11:12:17,720 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 281 transitions, 572 flow [2025-03-17 11:12:17,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,721 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] [2025-03-17 11:12:17,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:12:17,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1296397711, now seen corresponding path program 1 times [2025-03-17 11:12:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972957440] [2025-03-17 11:12:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:12:17,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:12:17,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972957440] [2025-03-17 11:12:17,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972957440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655885662] [2025-03-17 11:12:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 316 [2025-03-17 11:12:17,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 281 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 316 [2025-03-17 11:12:17,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,802 INFO L124 PetriNetUnfolderBase]: 16/353 cut-off events. [2025-03-17 11:12:17,802 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-17 11:12:17,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 353 events. 16/353 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1258 event pairs, 7 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 322. Up to 25 conditions per place. [2025-03-17 11:12:17,805 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-17 11:12:17,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 280 transitions, 596 flow [2025-03-17 11:12:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2025-03-17 11:12:17,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9419831223628692 [2025-03-17 11:12:17,807 INFO L175 Difference]: Start difference. First operand has 280 places, 281 transitions, 572 flow. Second operand 3 states and 893 transitions. [2025-03-17 11:12:17,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 280 transitions, 596 flow [2025-03-17 11:12:17,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 280 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,810 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 570 flow [2025-03-17 11:12:17,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-17 11:12:17,811 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-17 11:12:17,811 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 570 flow [2025-03-17 11:12:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,811 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] [2025-03-17 11:12:17,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:12:17,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 675025016, now seen corresponding path program 1 times [2025-03-17 11:12:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478370054] [2025-03-17 11:12:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 11:12:17,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 11:12:17,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478370054] [2025-03-17 11:12:17,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478370054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463543076] [2025-03-17 11:12:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-17 11:12:17,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-17 11:12:17,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,937 INFO L124 PetriNetUnfolderBase]: 33/699 cut-off events. [2025-03-17 11:12:17,937 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:12:17,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 699 events. 33/699 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3909 event pairs, 8 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 672. Up to 31 conditions per place. [2025-03-17 11:12:17,944 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-17 11:12:17,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 282 transitions, 606 flow [2025-03-17 11:12:17,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-17 11:12:17,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-17 11:12:17,946 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 570 flow. Second operand 3 states and 902 transitions. [2025-03-17 11:12:17,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 282 transitions, 606 flow [2025-03-17 11:12:17,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,950 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 576 flow [2025-03-17 11:12:17,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-03-17 11:12:17,952 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:17,952 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 576 flow [2025-03-17 11:12:17,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,953 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] [2025-03-17 11:12:17,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:12:17,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 633968644, now seen corresponding path program 1 times [2025-03-17 11:12:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935772661] [2025-03-17 11:12:17,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:12:17,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:12:17,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935772661] [2025-03-17 11:12:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935772661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947058408] [2025-03-17 11:12:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:18,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 316 [2025-03-17 11:12:18,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:18,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 316 [2025-03-17 11:12:18,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,089 INFO L124 PetriNetUnfolderBase]: 70/1041 cut-off events. [2025-03-17 11:12:18,089 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:12:18,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1041 events. 70/1041 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7338 event pairs, 10 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1005. Up to 73 conditions per place. [2025-03-17 11:12:18,098 INFO L140 encePairwiseOnDemand]: 310/316 looper letters, 15 selfloop transitions, 3 changer transitions 0/282 dead transitions. [2025-03-17 11:12:18,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 282 transitions, 618 flow [2025-03-17 11:12:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-17 11:12:18,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462025316455697 [2025-03-17 11:12:18,100 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 576 flow. Second operand 3 states and 897 transitions. [2025-03-17 11:12:18,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 282 transitions, 618 flow [2025-03-17 11:12:18,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 282 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:18,105 INFO L231 Difference]: Finished difference. Result has 278 places, 280 transitions, 591 flow [2025-03-17 11:12:18,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=280} [2025-03-17 11:12:18,110 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:18,110 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 280 transitions, 591 flow [2025-03-17 11:12:18,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:18,111 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] [2025-03-17 11:12:18,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:12:18,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:18,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1589278721, now seen corresponding path program 1 times [2025-03-17 11:12:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065091549] [2025-03-17 11:12:18,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:18,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 11:12:18,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 11:12:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065091549] [2025-03-17 11:12:18,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065091549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:18,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:18,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029307582] [2025-03-17 11:12:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:18,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:18,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:18,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:18,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-17 11:12:18,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 280 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:18,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-17 11:12:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,266 INFO L124 PetriNetUnfolderBase]: 31/808 cut-off events. [2025-03-17 11:12:18,266 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-17 11:12:18,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 808 events. 31/808 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4411 event pairs, 2 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 723. Up to 38 conditions per place. [2025-03-17 11:12:18,275 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-17 11:12:18,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 285 transitions, 642 flow [2025-03-17 11:12:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-03-17 11:12:18,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-03-17 11:12:18,277 INFO L175 Difference]: Start difference. First operand has 278 places, 280 transitions, 591 flow. Second operand 3 states and 905 transitions. [2025-03-17 11:12:18,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 285 transitions, 642 flow [2025-03-17 11:12:18,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 285 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:18,281 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 601 flow [2025-03-17 11:12:18,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2025-03-17 11:12:18,282 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-17 11:12:18,282 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 601 flow [2025-03-17 11:12:18,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:18,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:18,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:12:18,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:18,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -106000285, now seen corresponding path program 1 times [2025-03-17 11:12:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426735894] [2025-03-17 11:12:18,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:18,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:12:18,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:12:18,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:18,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426735894] [2025-03-17 11:12:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426735894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047746382] [2025-03-17 11:12:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:18,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:18,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:18,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:18,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-17 11:12:18,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:18,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-17 11:12:18,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,443 INFO L124 PetriNetUnfolderBase]: 39/807 cut-off events. [2025-03-17 11:12:18,443 INFO L125 PetriNetUnfolderBase]: For 5/26 co-relation queries the response was YES. [2025-03-17 11:12:18,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 807 events. 39/807 cut-off events. For 5/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4568 event pairs, 8 based on Foata normal form. 3/713 useless extension candidates. Maximal degree in co-relation 756. Up to 32 conditions per place. [2025-03-17 11:12:18,454 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-17 11:12:18,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 281 transitions, 631 flow [2025-03-17 11:12:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-17 11:12:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-17 11:12:18,456 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 601 flow. Second operand 3 states and 902 transitions. [2025-03-17 11:12:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 281 transitions, 631 flow [2025-03-17 11:12:18,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 281 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:18,460 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 603 flow [2025-03-17 11:12:18,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2025-03-17 11:12:18,460 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-17 11:12:18,460 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 603 flow [2025-03-17 11:12:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:18,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:12:18,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1711486684, now seen corresponding path program 1 times [2025-03-17 11:12:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433579536] [2025-03-17 11:12:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:12:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:12:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:18,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433579536] [2025-03-17 11:12:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433579536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:18,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:18,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346275588] [2025-03-17 11:12:18,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:18,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:18,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:18,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:18,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:18,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-17 11:12:18,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:18,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-17 11:12:18,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,648 INFO L124 PetriNetUnfolderBase]: 43/1122 cut-off events. [2025-03-17 11:12:18,648 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-03-17 11:12:18,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 1122 events. 43/1122 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7374 event pairs, 6 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 1092. Up to 64 conditions per place. [2025-03-17 11:12:18,655 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 16 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-17 11:12:18,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 284 transitions, 654 flow [2025-03-17 11:12:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2025-03-17 11:12:18,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546413502109705 [2025-03-17 11:12:18,657 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 603 flow. Second operand 3 states and 905 transitions. [2025-03-17 11:12:18,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 284 transitions, 654 flow [2025-03-17 11:12:18,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 284 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:18,660 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 609 flow [2025-03-17 11:12:18,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-17 11:12:18,660 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-17 11:12:18,660 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 609 flow [2025-03-17 11:12:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:18,661 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] [2025-03-17 11:12:18,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:12:18,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:18,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -158907212, now seen corresponding path program 1 times [2025-03-17 11:12:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773294069] [2025-03-17 11:12:18,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 11:12:18,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 11:12:18,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:18,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773294069] [2025-03-17 11:12:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773294069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:18,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526021421] [2025-03-17 11:12:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:18,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:18,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:18,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 316 [2025-03-17 11:12:18,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 609 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:18,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 316 [2025-03-17 11:12:18,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:18,944 INFO L124 PetriNetUnfolderBase]: 240/3552 cut-off events. [2025-03-17 11:12:18,944 INFO L125 PetriNetUnfolderBase]: For 69/81 co-relation queries the response was YES. [2025-03-17 11:12:18,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 3552 events. 240/3552 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 35355 event pairs, 60 based on Foata normal form. 1/3163 useless extension candidates. Maximal degree in co-relation 3450. Up to 331 conditions per place. [2025-03-17 11:12:18,968 INFO L140 encePairwiseOnDemand]: 308/316 looper letters, 17 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2025-03-17 11:12:18,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 281 transitions, 657 flow [2025-03-17 11:12:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2025-03-17 11:12:18,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9409282700421941 [2025-03-17 11:12:18,970 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 609 flow. Second operand 3 states and 892 transitions. [2025-03-17 11:12:18,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 281 transitions, 657 flow [2025-03-17 11:12:18,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 281 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:18,973 INFO L231 Difference]: Finished difference. Result has 278 places, 279 transitions, 629 flow [2025-03-17 11:12:18,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=278, PETRI_TRANSITIONS=279} [2025-03-17 11:12:18,974 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:18,974 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 279 transitions, 629 flow [2025-03-17 11:12:18,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:18,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:18,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:18,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:18,975 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1756875633, now seen corresponding path program 1 times [2025-03-17 11:12:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594813595] [2025-03-17 11:12:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:12:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:12:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594813595] [2025-03-17 11:12:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594813595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171941080] [2025-03-17 11:12:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 316 [2025-03-17 11:12:19,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 279 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 316 [2025-03-17 11:12:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,231 INFO L124 PetriNetUnfolderBase]: 115/2657 cut-off events. [2025-03-17 11:12:19,232 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-03-17 11:12:19,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 2657 events. 115/2657 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 23773 event pairs, 16 based on Foata normal form. 0/2401 useless extension candidates. Maximal degree in co-relation 2527. Up to 168 conditions per place. [2025-03-17 11:12:19,249 INFO L140 encePairwiseOnDemand]: 312/316 looper letters, 15 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2025-03-17 11:12:19,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 283 transitions, 675 flow [2025-03-17 11:12:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-17 11:12:19,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-17 11:12:19,251 INFO L175 Difference]: Start difference. First operand has 278 places, 279 transitions, 629 flow. Second operand 3 states and 904 transitions. [2025-03-17 11:12:19,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 283 transitions, 675 flow [2025-03-17 11:12:19,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 283 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:19,254 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 639 flow [2025-03-17 11:12:19,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2025-03-17 11:12:19,255 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-17 11:12:19,255 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 639 flow [2025-03-17 11:12:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.6666666666667) internal successors, (890), 3 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,255 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:12:19,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:19,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash -932605264, now seen corresponding path program 1 times [2025-03-17 11:12:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731346665] [2025-03-17 11:12:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:12:19,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:12:19,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:19,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731346665] [2025-03-17 11:12:19,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731346665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336303154] [2025-03-17 11:12:19,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-17 11:12:19,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-17 11:12:19,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,473 INFO L124 PetriNetUnfolderBase]: 108/2291 cut-off events. [2025-03-17 11:12:19,473 INFO L125 PetriNetUnfolderBase]: For 24/59 co-relation queries the response was YES. [2025-03-17 11:12:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 2291 events. 108/2291 cut-off events. For 24/59 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 19901 event pairs, 22 based on Foata normal form. 2/2086 useless extension candidates. Maximal degree in co-relation 2191. Up to 80 conditions per place. [2025-03-17 11:12:19,488 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-17 11:12:19,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 669 flow [2025-03-17 11:12:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-17 11:12:19,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-17 11:12:19,490 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 639 flow. Second operand 3 states and 902 transitions. [2025-03-17 11:12:19,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 669 flow [2025-03-17 11:12:19,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 280 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:19,493 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 641 flow [2025-03-17 11:12:19,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2025-03-17 11:12:19,494 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -9 predicate places. [2025-03-17 11:12:19,494 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 641 flow [2025-03-17 11:12:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:19,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:12:19,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:19,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash -835674343, now seen corresponding path program 1 times [2025-03-17 11:12:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578278503] [2025-03-17 11:12:19,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:12:19,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:12:19,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:19,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578278503] [2025-03-17 11:12:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578278503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839854872] [2025-03-17 11:12:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 316 [2025-03-17 11:12:19,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 316 [2025-03-17 11:12:19,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L55-6-->L55-5: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet12#1][180], [Black: 351#true, 338#(= |#race~length_2~0| 0), 240#L77true, Black: 355#true, 359#true, 362#true, 349#(= |#race~to_int_3~0| 0), 125#L55-5true, Black: 332#true, 353#(= |#race~length_4~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, 357#(= |#race~to_int_5~0| 0), Black: 347#true, 342#(= |#race~to_int_1~0| 0)]) [2025-03-17 11:12:19,662 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-17 11:12:19,662 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-17 11:12:19,662 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-17 11:12:19,662 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-17 11:12:19,665 INFO L124 PetriNetUnfolderBase]: 136/1683 cut-off events. [2025-03-17 11:12:19,665 INFO L125 PetriNetUnfolderBase]: For 87/114 co-relation queries the response was YES. [2025-03-17 11:12:19,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2156 conditions, 1683 events. 136/1683 cut-off events. For 87/114 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13932 event pairs, 36 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1861. Up to 160 conditions per place. [2025-03-17 11:12:19,677 INFO L140 encePairwiseOnDemand]: 313/316 looper letters, 11 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-03-17 11:12:19,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 671 flow [2025-03-17 11:12:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2025-03-17 11:12:19,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514767932489452 [2025-03-17 11:12:19,678 INFO L175 Difference]: Start difference. First operand has 280 places, 278 transitions, 641 flow. Second operand 3 states and 902 transitions. [2025-03-17 11:12:19,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 671 flow [2025-03-17 11:12:19,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:19,682 INFO L231 Difference]: Finished difference. Result has 279 places, 277 transitions, 639 flow [2025-03-17 11:12:19,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=279, PETRI_TRANSITIONS=277} [2025-03-17 11:12:19,682 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2025-03-17 11:12:19,682 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 277 transitions, 639 flow [2025-03-17 11:12:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,683 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] [2025-03-17 11:12:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:12:19,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:19,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,683 INFO L85 PathProgramCache]: Analyzing trace with hash 182037743, now seen corresponding path program 1 times [2025-03-17 11:12:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112689136] [2025-03-17 11:12:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:12:19,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:12:19,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112689136] [2025-03-17 11:12:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112689136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771547438] [2025-03-17 11:12:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-17 11:12:19,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 277 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-17 11:12:19,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,909 INFO L124 PetriNetUnfolderBase]: 73/1997 cut-off events. [2025-03-17 11:12:19,909 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-03-17 11:12:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1997 events. 73/1997 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16261 event pairs, 4 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 1998. Up to 66 conditions per place. [2025-03-17 11:12:19,921 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2025-03-17 11:12:19,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 655 flow [2025-03-17 11:12:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-17 11:12:19,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-17 11:12:19,923 INFO L175 Difference]: Start difference. First operand has 279 places, 277 transitions, 639 flow. Second operand 3 states and 904 transitions. [2025-03-17 11:12:19,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 655 flow [2025-03-17 11:12:19,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 276 transitions, 651 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:19,927 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 635 flow [2025-03-17 11:12:19,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-03-17 11:12:19,928 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:19,928 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 635 flow [2025-03-17 11:12:19,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:19,928 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] [2025-03-17 11:12:19,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:12:19,928 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:19,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:19,929 INFO L85 PathProgramCache]: Analyzing trace with hash -831645310, now seen corresponding path program 1 times [2025-03-17 11:12:19,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:19,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916236940] [2025-03-17 11:12:19,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:19,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 11:12:19,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 11:12:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916236940] [2025-03-17 11:12:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916236940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727709373] [2025-03-17 11:12:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:19,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:19,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:19,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:19,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-17 11:12:19,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:19,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:19,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-17 11:12:19,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:20,133 INFO L124 PetriNetUnfolderBase]: 70/2132 cut-off events. [2025-03-17 11:12:20,133 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-03-17 11:12:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 2132 events. 70/2132 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17497 event pairs, 11 based on Foata normal form. 0/1985 useless extension candidates. Maximal degree in co-relation 2327. Up to 67 conditions per place. [2025-03-17 11:12:20,142 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 8 selfloop transitions, 1 changer transitions 0/275 dead transitions. [2025-03-17 11:12:20,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 275 transitions, 651 flow [2025-03-17 11:12:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2025-03-17 11:12:20,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535864978902954 [2025-03-17 11:12:20,144 INFO L175 Difference]: Start difference. First operand has 278 places, 276 transitions, 635 flow. Second operand 3 states and 904 transitions. [2025-03-17 11:12:20,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 275 transitions, 651 flow [2025-03-17 11:12:20,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 275 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:20,147 INFO L231 Difference]: Finished difference. Result has 278 places, 275 transitions, 634 flow [2025-03-17 11:12:20,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=278, PETRI_TRANSITIONS=275} [2025-03-17 11:12:20,147 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:20,147 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 275 transitions, 634 flow [2025-03-17 11:12:20,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:20,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:20,148 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] [2025-03-17 11:12:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:12:20,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-17 11:12:20,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:20,149 INFO L85 PathProgramCache]: Analyzing trace with hash -481450772, now seen corresponding path program 1 times [2025-03-17 11:12:20,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928898618] [2025-03-17 11:12:20,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:20,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 11:12:20,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 11:12:20,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:20,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:20,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928898618] [2025-03-17 11:12:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928898618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62886924] [2025-03-17 11:12:20,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:20,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:20,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 316 [2025-03-17 11:12:20,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 275 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:20,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:20,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 316 [2025-03-17 11:12:20,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:20,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([770] L55-5-->L55-3: Formula: (= |v_#race~result_8~0_2| |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, #race~result_8~0=|v_#race~result_8~0_2|} AuxVars[] AssignedVars[#race~result_8~0][187], [368#true, 338#(= |#race~length_2~0| 0), Black: 351#true, 240#L77true, Black: 355#true, 349#(= |#race~to_int_3~0| 0), 266#L55-3true, Black: 332#true, 353#(= |#race~length_4~0| 0), Black: 336#true, 334#(= |#race~length_0~0| 0), Black: 340#true, 357#(= |#race~to_int_5~0| 0), 371#true, Black: 347#true, 342#(= |#race~to_int_1~0| 0)]) [2025-03-17 11:12:20,289 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-03-17 11:12:20,289 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-17 11:12:20,289 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-17 11:12:20,289 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-17 11:12:20,290 INFO L124 PetriNetUnfolderBase]: 68/1501 cut-off events. [2025-03-17 11:12:20,290 INFO L125 PetriNetUnfolderBase]: For 21/36 co-relation queries the response was YES. [2025-03-17 11:12:20,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 1501 events. 68/1501 cut-off events. For 21/36 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 11445 event pairs, 18 based on Foata normal form. 10/1395 useless extension candidates. Maximal degree in co-relation 1722. Up to 87 conditions per place. [2025-03-17 11:12:20,299 INFO L140 encePairwiseOnDemand]: 314/316 looper letters, 0 selfloop transitions, 0 changer transitions 274/274 dead transitions. [2025-03-17 11:12:20,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 274 transitions, 648 flow [2025-03-17 11:12:20,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2025-03-17 11:12:20,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525316455696202 [2025-03-17 11:12:20,301 INFO L175 Difference]: Start difference. First operand has 278 places, 275 transitions, 634 flow. Second operand 3 states and 903 transitions. [2025-03-17 11:12:20,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 274 transitions, 648 flow [2025-03-17 11:12:20,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 274 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:20,303 INFO L231 Difference]: Finished difference. Result has 278 places, 0 transitions, 0 flow [2025-03-17 11:12:20,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=316, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=278, PETRI_TRANSITIONS=0} [2025-03-17 11:12:20,303 INFO L279 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2025-03-17 11:12:20,303 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 0 transitions, 0 flow [2025-03-17 11:12:20,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (41 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (31 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (30 of 48 remaining) [2025-03-17 11:12:20,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (1 of 48 remaining) [2025-03-17 11:12:20,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 48 remaining) [2025-03-17 11:12:20,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:12:20,308 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-03-17 11:12:20,311 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:12:20,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:12:20,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:12:20 BasicIcfg [2025-03-17 11:12:20,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:12:20,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:12:20,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:12:20,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:12:20,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:16" (3/4) ... [2025-03-17 11:12:20,316 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:12:20,318 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:12:20,319 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:12:20,319 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:12:20,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 11:12:20,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:12:20,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:12:20,322 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:12:20,372 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:12:20,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:12:20,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:12:20,374 INFO L158 Benchmark]: Toolchain (without parser) took 4619.21ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 124.7MB in the beginning and 227.2MB in the end (delta: -102.5MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2025-03-17 11:12:20,374 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:20,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:20,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.18ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:20,375 INFO L158 Benchmark]: Boogie Preprocessor took 28.98ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:20,375 INFO L158 Benchmark]: IcfgBuilder took 420.30ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 87.5MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:12:20,375 INFO L158 Benchmark]: TraceAbstraction took 3888.61ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 86.7MB in the beginning and 231.3MB in the end (delta: -144.6MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2025-03-17 11:12:20,375 INFO L158 Benchmark]: Witness Printer took 58.11ms. Allocated memory is still 402.7MB. Free memory was 231.3MB in the beginning and 227.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:20,377 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 112.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.18ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.98ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 109.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 420.30ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 87.5MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3888.61ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 86.7MB in the beginning and 231.3MB in the end (delta: -144.6MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. * Witness Printer took 58.11ms. Allocated memory is still 402.7MB. Free memory was 231.3MB in the beginning and 227.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 479 locations, 505 edges, 48 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 483 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 76 mSDtfsCounter, 483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=14, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1487 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:12:20,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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