./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/pthread-ext/11_fmaxsymopt-race.i -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 c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:37:08,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:37:08,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:37:08,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:37:08,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:37:08,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:37:08,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:37:08,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:37:08,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:37:08,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:37:08,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:37:08,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:37:08,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:37:08,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:37:08,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:37:08,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:37:08,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:37:08,966 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 -> c885fc256284ed3b5456c69b30daa307e14001acfa6c144983451f9519cbd1fd [2025-03-08 21:37:09,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:37:09,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:37:09,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:37:09,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:37:09,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:37:09,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-08 21:37:10,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ec4117/a00fc6cbf5ea4e0398947a66db785f19/FLAG3b0d21f56 [2025-03-08 21:37:10,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:37:10,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-race.i [2025-03-08 21:37:10,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ec4117/a00fc6cbf5ea4e0398947a66db785f19/FLAG3b0d21f56 [2025-03-08 21:37:11,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797ec4117/a00fc6cbf5ea4e0398947a66db785f19 [2025-03-08 21:37:11,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:37:11,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:37:11,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:37:11,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:37:11,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:37:11,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11, skipping insertion in model container [2025-03-08 21:37:11,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:37:11,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:37:11,308 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:37:11,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:37:11,367 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:37:11,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11 WrapperNode [2025-03-08 21:37:11,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:37:11,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:37:11,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:37:11,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:37:11,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,405 INFO L138 Inliner]: procedures = 164, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2025-03-08 21:37:11,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:37:11,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:37:11,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:37:11,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:37:11,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,425 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:37:11,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:37:11,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:37:11,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:37:11,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (1/1) ... [2025-03-08 21:37:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:37:11,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:11,472 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-08 21:37:11,474 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-08 21:37:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:37:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:37:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:37:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:37:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:37:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:37:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:37:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:37:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:37:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:37:11,493 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:37:11,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:37:11,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:37:11,797 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:37:11,797 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:37:11,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:37:11,809 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:37:11,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:11 BoogieIcfgContainer [2025-03-08 21:37:11,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:37:11,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:37:11,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:37:11,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:37:11,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:11" (1/3) ... [2025-03-08 21:37:11,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366c741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:11, skipping insertion in model container [2025-03-08 21:37:11,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:11" (2/3) ... [2025-03-08 21:37:11,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5366c741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:11, skipping insertion in model container [2025-03-08 21:37:11,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:11" (3/3) ... [2025-03-08 21:37:11,817 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-race.i [2025-03-08 21:37:11,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:37:11,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-race.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-08 21:37:11,829 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:37:11,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:11,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 122 transitions, 248 flow [2025-03-08 21:37:11,989 INFO L124 PetriNetUnfolderBase]: 8/129 cut-off events. [2025-03-08 21:37:11,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 129 events. 8/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-08 21:37:11,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 122 transitions, 248 flow [2025-03-08 21:37:12,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 122 transitions, 248 flow [2025-03-08 21:37:12,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:12,021 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;@621c786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:12,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 21:37:12,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:12,038 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:12,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:12,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:12,039 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] [2025-03-08 21:37:12,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 242270650, now seen corresponding path program 1 times [2025-03-08 21:37:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-03-08 21:37:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:12,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:12,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:12,661 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-08 21:37:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202983473] [2025-03-08 21:37:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202983473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:12,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929551314] [2025-03-08 21:37:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:12,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:12,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:12,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122 [2025-03-08 21:37:12,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-08 21:37:12,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:12,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122 [2025-03-08 21:37:12,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:12,934 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-08 21:37:12,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:37:12,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2025-03-08 21:37:12,935 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 13 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-03-08 21:37:12,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 264 flow [2025-03-08 21:37:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2025-03-08 21:37:12,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8265027322404371 [2025-03-08 21:37:12,956 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 248 flow. Second operand 6 states and 605 transitions. [2025-03-08 21:37:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 264 flow [2025-03-08 21:37:12,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:12,966 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 238 flow [2025-03-08 21:37:12,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-08 21:37:12,971 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-08 21:37:12,973 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 238 flow [2025-03-08 21:37:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 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-08 21:37:12,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:12,974 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:12,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:37:12,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1896431640, now seen corresponding path program 1 times [2025-03-08 21:37:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-08 21:37:12,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 21:37:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 21:37:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:12,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,031 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-08 21:37:13,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:13,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-08 21:37:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889697603] [2025-03-08 21:37:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:13,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:13,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:13,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:13,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:13,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 122 [2025-03-08 21:37:13,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-08 21:37:13,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:13,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 122 [2025-03-08 21:37:13,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:13,091 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events. [2025-03-08 21:37:13,092 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:37:13,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 127 events. 5/127 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 9 conditions per place. [2025-03-08 21:37:13,093 INFO L140 encePairwiseOnDemand]: 119/122 looper letters, 7 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-08 21:37:13,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 260 flow [2025-03-08 21:37:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2025-03-08 21:37:13,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912568306010929 [2025-03-08 21:37:13,094 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 238 flow. Second operand 3 states and 334 transitions. [2025-03-08 21:37:13,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 260 flow [2025-03-08 21:37:13,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:13,097 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 240 flow [2025-03-08 21:37:13,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-03-08 21:37:13,098 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-08 21:37:13,098 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 240 flow [2025-03-08 21:37:13,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-08 21:37:13,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:13,098 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:13,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:37:13,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1800088938, now seen corresponding path program 1 times [2025-03-08 21:37:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-08 21:37:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:13,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:37:13,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:37:13,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:13,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-08 21:37:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838722956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468238690] [2025-03-08 21:37:13,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:13,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:13,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:13,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:37:13,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 21:37:13,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 21:37:13,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:13,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:13,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:13,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:13,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468238690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:13,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:13,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:13,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729890745] [2025-03-08 21:37:13,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:13,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:13,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:13,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:13,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:13,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-08 21:37:13,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 240 flow. Second operand has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-08 21:37:13,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:13,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-08 21:37:13,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:13,553 INFO L124 PetriNetUnfolderBase]: 5/142 cut-off events. [2025-03-08 21:37:13,553 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:37:13,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 142 events. 5/142 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2025-03-08 21:37:13,554 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 11 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2025-03-08 21:37:13,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 298 flow [2025-03-08 21:37:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2025-03-08 21:37:13,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8806921675774135 [2025-03-08 21:37:13,556 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 240 flow. Second operand 9 states and 967 transitions. [2025-03-08 21:37:13,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 121 transitions, 298 flow [2025-03-08 21:37:13,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:13,559 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 288 flow [2025-03-08 21:37:13,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-03-08 21:37:13,559 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-08 21:37:13,560 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 288 flow [2025-03-08 21:37:13,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-08 21:37:13,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:13,560 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:13,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:13,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:13,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1402008106, now seen corresponding path program 2 times [2025-03-08 21:37:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100619302] [2025-03-08 21:37:13,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:13,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:13,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 21:37:13,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:37:13,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:13,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100619302] [2025-03-08 21:37:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100619302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127517531] [2025-03-08 21:37:13,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:13,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:13,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:13,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:13,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:37:13,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-08 21:37:14,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 21:37:14,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:14,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:14,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:14,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127517531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:14,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:14,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294079129] [2025-03-08 21:37:14,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:14,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:14,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:14,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:14,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:14,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 122 [2025-03-08 21:37:14,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 288 flow. Second operand has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-08 21:37:14,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:14,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 122 [2025-03-08 21:37:14,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:14,518 INFO L124 PetriNetUnfolderBase]: 5/181 cut-off events. [2025-03-08 21:37:14,518 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 21:37:14,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 181 events. 5/181 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 103 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 9 conditions per place. [2025-03-08 21:37:14,521 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 14 selfloop transitions, 18 changer transitions 0/133 dead transitions. [2025-03-08 21:37:14,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 426 flow [2025-03-08 21:37:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1925 transitions. [2025-03-08 21:37:14,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8765938069216758 [2025-03-08 21:37:14,525 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 288 flow. Second operand 18 states and 1925 transitions. [2025-03-08 21:37:14,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 426 flow [2025-03-08 21:37:14,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:14,530 INFO L231 Difference]: Finished difference. Result has 143 places, 129 transitions, 388 flow [2025-03-08 21:37:14,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=388, PETRI_PLACES=143, PETRI_TRANSITIONS=129} [2025-03-08 21:37:14,533 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-08 21:37:14,534 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 388 flow [2025-03-08 21:37:14,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 107.06666666666666) internal successors, (1606), 15 states have internal predecessors, (1606), 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-08 21:37:14,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:14,536 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:14,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:37:14,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 21:37:14,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-08 21:37:14,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1148885416, now seen corresponding path program 3 times [2025-03-08 21:37:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:14,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-03-08 21:37:14,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:14,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-08 21:37:14,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 21:37:14,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:37:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:14,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:14,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 21:37:14,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 21:37:14,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:14,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:14,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:14,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:14,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-08 21:37:14,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 21:37:14,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 21:37:14,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-08 21:37:14,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-08 21:37:14,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-08 21:37:14,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 21:37:14,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 21:37:14,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 21:37:14,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 21:37:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:37:14,864 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:14,867 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:14,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:37:14,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:14,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 192 transitions, 394 flow [2025-03-08 21:37:14,919 INFO L124 PetriNetUnfolderBase]: 15/208 cut-off events. [2025-03-08 21:37:14,919 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:37:14,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 208 events. 15/208 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 526 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 147. Up to 3 conditions per place. [2025-03-08 21:37:14,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 192 transitions, 394 flow [2025-03-08 21:37:14,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 192 transitions, 394 flow [2025-03-08 21:37:14,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:14,923 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;@621c786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:14,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-08 21:37:14,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:14,925 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:14,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:14,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:14,926 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] [2025-03-08 21:37:14,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1557277306, now seen corresponding path program 1 times [2025-03-08 21:37:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-03-08 21:37:14,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:14,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:14,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:15,112 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-08 21:37:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534511035] [2025-03-08 21:37:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534511035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-03-08 21:37:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:15,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:15,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:15,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:15,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:15,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 192 [2025-03-08 21:37:15,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 192 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-08 21:37:15,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:15,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 192 [2025-03-08 21:37:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:15,349 INFO L124 PetriNetUnfolderBase]: 90/600 cut-off events. [2025-03-08 21:37:15,349 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 21:37:15,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 600 events. 90/600 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3394 event pairs, 42 based on Foata normal form. 91/595 useless extension candidates. Maximal degree in co-relation 312. Up to 125 conditions per place. [2025-03-08 21:37:15,353 INFO L140 encePairwiseOnDemand]: 179/192 looper letters, 20 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2025-03-08 21:37:15,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 414 flow [2025-03-08 21:37:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2025-03-08 21:37:15,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411458333333334 [2025-03-08 21:37:15,356 INFO L175 Difference]: Start difference. First operand has 182 places, 192 transitions, 394 flow. Second operand 6 states and 969 transitions. [2025-03-08 21:37:15,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 177 transitions, 414 flow [2025-03-08 21:37:15,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:15,358 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 374 flow [2025-03-08 21:37:15,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2025-03-08 21:37:15,359 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-08 21:37:15,359 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 374 flow [2025-03-08 21:37:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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-08 21:37:15,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:15,360 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:15,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:37:15,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:15,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1159655658, now seen corresponding path program 1 times [2025-03-08 21:37:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-03-08 21:37:15,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:15,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:15,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 21:37:15,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 21:37:15,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:15,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:15,386 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-08 21:37:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:15,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263896957] [2025-03-08 21:37:15,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263896957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:15,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:15,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717929570] [2025-03-08 21:37:15,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:15,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:15,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:15,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:15,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2025-03-08 21:37:15,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-08 21:37:15,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:15,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2025-03-08 21:37:15,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:15,453 INFO L124 PetriNetUnfolderBase]: 23/345 cut-off events. [2025-03-08 21:37:15,454 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-08 21:37:15,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 345 events. 23/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1168 event pairs, 6 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 332. Up to 24 conditions per place. [2025-03-08 21:37:15,457 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 10 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-03-08 21:37:15,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 402 flow [2025-03-08 21:37:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-08 21:37:15,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2025-03-08 21:37:15,458 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 374 flow. Second operand 3 states and 526 transitions. [2025-03-08 21:37:15,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 178 transitions, 402 flow [2025-03-08 21:37:15,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:15,463 INFO L231 Difference]: Finished difference. Result has 176 places, 178 transitions, 376 flow [2025-03-08 21:37:15,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=176, PETRI_TRANSITIONS=178} [2025-03-08 21:37:15,465 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-08 21:37:15,465 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 178 transitions, 376 flow [2025-03-08 21:37:15,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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-08 21:37:15,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:15,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:15,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:37:15,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:15,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2058549844, now seen corresponding path program 1 times [2025-03-08 21:37:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:15,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095355847] [2025-03-08 21:37:15,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:15,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:37:15,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:37:15,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:15,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:15,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095355847] [2025-03-08 21:37:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095355847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666796419] [2025-03-08 21:37:15,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:15,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:15,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:37:15,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:37:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:37:15,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:15,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:15,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:15,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:15,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666796419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:15,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59165396] [2025-03-08 21:37:15,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:15,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-08 21:37:15,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 178 transitions, 376 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-08 21:37:15,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:15,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-08 21:37:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:15,806 INFO L124 PetriNetUnfolderBase]: 23/360 cut-off events. [2025-03-08 21:37:15,806 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 21:37:15,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 360 events. 23/360 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1137 event pairs, 6 based on Foata normal form. 2/321 useless extension candidates. Maximal degree in co-relation 367. Up to 24 conditions per place. [2025-03-08 21:37:15,809 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 14 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-03-08 21:37:15,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 186 transitions, 440 flow [2025-03-08 21:37:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1537 transitions. [2025-03-08 21:37:15,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8894675925925926 [2025-03-08 21:37:15,811 INFO L175 Difference]: Start difference. First operand has 176 places, 178 transitions, 376 flow. Second operand 9 states and 1537 transitions. [2025-03-08 21:37:15,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 186 transitions, 440 flow [2025-03-08 21:37:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:15,813 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 424 flow [2025-03-08 21:37:15,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=424, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2025-03-08 21:37:15,814 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-08 21:37:15,814 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 424 flow [2025-03-08 21:37:15,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-08 21:37:15,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:15,815 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:15,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:16,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:16,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:16,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 85852780, now seen corresponding path program 2 times [2025-03-08 21:37:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-08 21:37:16,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:16,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 21:37:16,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:37:16,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:16,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63390728] [2025-03-08 21:37:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63390728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764308177] [2025-03-08 21:37:16,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:16,149 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:16,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:37:16,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-08 21:37:16,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 21:37:16,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:16,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:16,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:16,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:16,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:37:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764308177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:16,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:16,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:16,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421247339] [2025-03-08 21:37:16,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:16,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:16,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:16,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:16,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:16,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-08 21:37:16,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 424 flow. Second operand has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-08 21:37:16,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:16,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-08 21:37:16,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:16,654 INFO L124 PetriNetUnfolderBase]: 23/399 cut-off events. [2025-03-08 21:37:16,654 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-08 21:37:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 399 events. 23/399 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1139 event pairs, 6 based on Foata normal form. 3/361 useless extension candidates. Maximal degree in co-relation 329. Up to 24 conditions per place. [2025-03-08 21:37:16,657 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 17 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2025-03-08 21:37:16,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 568 flow [2025-03-08 21:37:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3062 transitions. [2025-03-08 21:37:16,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859953703703703 [2025-03-08 21:37:16,663 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 424 flow. Second operand 18 states and 3062 transitions. [2025-03-08 21:37:16,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 568 flow [2025-03-08 21:37:16,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:16,668 INFO L231 Difference]: Finished difference. Result has 206 places, 194 transitions, 524 flow [2025-03-08 21:37:16,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=524, PETRI_PLACES=206, PETRI_TRANSITIONS=194} [2025-03-08 21:37:16,669 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-08 21:37:16,669 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 524 flow [2025-03-08 21:37:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 170.13333333333333) internal successors, (2552), 15 states have internal predecessors, (2552), 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-08 21:37:16,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:16,670 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:16,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:16,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:37:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1905122646, now seen corresponding path program 3 times [2025-03-08 21:37:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625505099] [2025-03-08 21:37:16,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:16,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-08 21:37:16,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 21:37:16,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 21:37:16,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:16,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:16,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 21:37:16,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 21:37:16,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:16,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:16,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:16,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-08 21:37:16,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-08 21:37:16,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:37:16,938 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:16,939 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:16,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 21:37:16,961 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 262 transitions, 542 flow [2025-03-08 21:37:16,983 INFO L124 PetriNetUnfolderBase]: 22/287 cut-off events. [2025-03-08 21:37:16,983 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:37:16,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 22/287 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 916 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 216. Up to 4 conditions per place. [2025-03-08 21:37:16,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 262 transitions, 542 flow [2025-03-08 21:37:16,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 262 transitions, 542 flow [2025-03-08 21:37:16,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:16,988 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;@621c786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:16,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 21:37:16,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:16,991 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:16,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:16,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:16,991 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] [2025-03-08 21:37:16,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:16,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 264705728, now seen corresponding path program 1 times [2025-03-08 21:37:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:16,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 21:37:16,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:16,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:16,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:16,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:16,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:17,149 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-08 21:37:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 21:37:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474866706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066207746] [2025-03-08 21:37:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:17,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:17,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:17,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:17,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:17,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 262 [2025-03-08 21:37:17,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-08 21:37:17,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:17,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 262 [2025-03-08 21:37:17,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:17,778 INFO L124 PetriNetUnfolderBase]: 1081/4122 cut-off events. [2025-03-08 21:37:17,778 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-03-08 21:37:17,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 4122 events. 1081/4122 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 38989 event pairs, 630 based on Foata normal form. 720/4055 useless extension candidates. Maximal degree in co-relation 1470. Up to 1318 conditions per place. [2025-03-08 21:37:17,816 INFO L140 encePairwiseOnDemand]: 246/262 looper letters, 27 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2025-03-08 21:37:17,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 242 transitions, 566 flow [2025-03-08 21:37:17,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2025-03-08 21:37:17,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479643765903307 [2025-03-08 21:37:17,819 INFO L175 Difference]: Start difference. First operand has 247 places, 262 transitions, 542 flow. Second operand 6 states and 1333 transitions. [2025-03-08 21:37:17,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 242 transitions, 566 flow [2025-03-08 21:37:17,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 242 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:17,822 INFO L231 Difference]: Finished difference. Result has 241 places, 242 transitions, 510 flow [2025-03-08 21:37:17,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=241, PETRI_TRANSITIONS=242} [2025-03-08 21:37:17,823 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-08 21:37:17,823 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 242 transitions, 510 flow [2025-03-08 21:37:17,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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-08 21:37:17,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:17,823 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:17,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:37:17,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -481126473, now seen corresponding path program 1 times [2025-03-08 21:37:17,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:17,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-03-08 21:37:17,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:17,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:17,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 21:37:17,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 21:37:17,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:17,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:17,842 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-08 21:37:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583714935] [2025-03-08 21:37:17,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583714935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:17,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:17,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116724167] [2025-03-08 21:37:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:17,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:17,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:17,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:17,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 262 [2025-03-08 21:37:17,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 242 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:17,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:17,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 262 [2025-03-08 21:37:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:18,039 INFO L124 PetriNetUnfolderBase]: 95/1017 cut-off events. [2025-03-08 21:37:18,040 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-08 21:37:18,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 1017 events. 95/1017 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6163 event pairs, 42 based on Foata normal form. 1/883 useless extension candidates. Maximal degree in co-relation 1094. Up to 87 conditions per place. [2025-03-08 21:37:18,050 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 13 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-03-08 21:37:18,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 243 transitions, 544 flow [2025-03-08 21:37:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-08 21:37:18,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134860050890585 [2025-03-08 21:37:18,052 INFO L175 Difference]: Start difference. First operand has 241 places, 242 transitions, 510 flow. Second operand 3 states and 718 transitions. [2025-03-08 21:37:18,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 243 transitions, 544 flow [2025-03-08 21:37:18,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 243 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:18,055 INFO L231 Difference]: Finished difference. Result has 239 places, 243 transitions, 512 flow [2025-03-08 21:37:18,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=239, PETRI_TRANSITIONS=243} [2025-03-08 21:37:18,055 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-08 21:37:18,056 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 243 transitions, 512 flow [2025-03-08 21:37:18,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:37:18,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:18,056 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:18,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:37:18,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:18,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2005451263, now seen corresponding path program 1 times [2025-03-08 21:37:18,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:18,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-08 21:37:18,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:18,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:37:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:37:18,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974032068] [2025-03-08 21:37:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974032068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115672307] [2025-03-08 21:37:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:18,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:18,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:18,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:18,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:37:18,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 21:37:18,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 21:37:18,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:18,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:18,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:18,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115672307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:18,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491538357] [2025-03-08 21:37:18,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:18,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:18,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:18,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-08 21:37:18,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 243 transitions, 512 flow. Second operand has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-08 21:37:18,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:18,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-08 21:37:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:18,440 INFO L124 PetriNetUnfolderBase]: 95/1032 cut-off events. [2025-03-08 21:37:18,440 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-08 21:37:18,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1032 events. 95/1032 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6134 event pairs, 42 based on Foata normal form. 2/899 useless extension candidates. Maximal degree in co-relation 1129. Up to 87 conditions per place. [2025-03-08 21:37:18,451 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 17 selfloop transitions, 9 changer transitions 0/251 dead transitions. [2025-03-08 21:37:18,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 251 transitions, 582 flow [2025-03-08 21:37:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2107 transitions. [2025-03-08 21:37:18,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935538592027141 [2025-03-08 21:37:18,456 INFO L175 Difference]: Start difference. First operand has 239 places, 243 transitions, 512 flow. Second operand 9 states and 2107 transitions. [2025-03-08 21:37:18,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 251 transitions, 582 flow [2025-03-08 21:37:18,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 251 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:18,459 INFO L231 Difference]: Finished difference. Result has 249 places, 249 transitions, 560 flow [2025-03-08 21:37:18,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=249, PETRI_TRANSITIONS=249} [2025-03-08 21:37:18,460 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-08 21:37:18,460 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 249 transitions, 560 flow [2025-03-08 21:37:18,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.1) internal successors, (2331), 10 states have internal predecessors, (2331), 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-08 21:37:18,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:18,462 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:18,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 21:37:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 21:37:18,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:18,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1556737279, now seen corresponding path program 2 times [2025-03-08 21:37:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-08 21:37:18,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:18,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-08 21:37:18,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:37:18,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:18,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-08 21:37:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645408295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421448230] [2025-03-08 21:37:18,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:18,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:18,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:18,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:37:18,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-08 21:37:18,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 21:37:18,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:18,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:18,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:18,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421448230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:18,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899994026] [2025-03-08 21:37:18,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:18,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:18,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:19,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2025-03-08 21:37:19,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 249 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-08 21:37:19,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:19,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2025-03-08 21:37:19,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:19,269 INFO L124 PetriNetUnfolderBase]: 95/1071 cut-off events. [2025-03-08 21:37:19,270 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-08 21:37:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1071 events. 95/1071 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6167 event pairs, 42 based on Foata normal form. 3/939 useless extension candidates. Maximal degree in co-relation 1091. Up to 87 conditions per place. [2025-03-08 21:37:19,280 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 20 selfloop transitions, 18 changer transitions 0/263 dead transitions. [2025-03-08 21:37:19,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 263 transitions, 710 flow [2025-03-08 21:37:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4199 transitions. [2025-03-08 21:37:19,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.890373197625106 [2025-03-08 21:37:19,286 INFO L175 Difference]: Start difference. First operand has 249 places, 249 transitions, 560 flow. Second operand 18 states and 4199 transitions. [2025-03-08 21:37:19,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 263 transitions, 710 flow [2025-03-08 21:37:19,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 263 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:19,289 INFO L231 Difference]: Finished difference. Result has 269 places, 259 transitions, 660 flow [2025-03-08 21:37:19,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=660, PETRI_PLACES=269, PETRI_TRANSITIONS=259} [2025-03-08 21:37:19,290 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-08 21:37:19,290 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 259 transitions, 660 flow [2025-03-08 21:37:19,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 233.2) internal successors, (3498), 15 states have internal predecessors, (3498), 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-08 21:37:19,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:19,291 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:19,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 21:37:19,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:19,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-08 21:37:19,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:19,497 INFO L85 PathProgramCache]: Analyzing trace with hash 752400055, now seen corresponding path program 3 times [2025-03-08 21:37:19,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434116129] [2025-03-08 21:37:19,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:19,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-08 21:37:19,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 21:37:19,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:37:19,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:19,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:19,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 21:37:19,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 21:37:19,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:19,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:19,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:19,564 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:19,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-08 21:37:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-08 21:37:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:37:19,565 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 21:37:19,566 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:19,566 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-08 21:37:19,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:19,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 332 transitions, 692 flow [2025-03-08 21:37:19,650 INFO L124 PetriNetUnfolderBase]: 29/366 cut-off events. [2025-03-08 21:37:19,650 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:37:19,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 366 events. 29/366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1328 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 5 conditions per place. [2025-03-08 21:37:19,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 332 transitions, 692 flow [2025-03-08 21:37:19,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 332 transitions, 692 flow [2025-03-08 21:37:19,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:19,660 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;@621c786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:19,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 21:37:19,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:19,664 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:19,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:19,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:19,664 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] [2025-03-08 21:37:19,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:19,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 659523212, now seen corresponding path program 1 times [2025-03-08 21:37:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971677844] [2025-03-08 21:37:19,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:19,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:19,839 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-08 21:37:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971677844] [2025-03-08 21:37:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971677844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-03-08 21:37:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:19,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:19,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:20,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 332 [2025-03-08 21:37:20,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 332 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-08 21:37:20,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:20,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 332 [2025-03-08 21:37:20,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:23,252 INFO L124 PetriNetUnfolderBase]: 10778/30460 cut-off events. [2025-03-08 21:37:23,252 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-03-08 21:37:23,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44913 conditions, 30460 events. 10778/30460 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 371221 event pairs, 6804 based on Foata normal form. 6397/30591 useless extension candidates. Maximal degree in co-relation 6942. Up to 12509 conditions per place. [2025-03-08 21:37:23,591 INFO L140 encePairwiseOnDemand]: 313/332 looper letters, 34 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2025-03-08 21:37:23,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 720 flow [2025-03-08 21:37:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:37:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:37:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1697 transitions. [2025-03-08 21:37:23,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8519076305220884 [2025-03-08 21:37:23,593 INFO L175 Difference]: Start difference. First operand has 312 places, 332 transitions, 692 flow. Second operand 6 states and 1697 transitions. [2025-03-08 21:37:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 720 flow [2025-03-08 21:37:23,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-08 21:37:23,601 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 646 flow [2025-03-08 21:37:23,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-03-08 21:37:23,602 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-08 21:37:23,603 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 646 flow [2025-03-08 21:37:23,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.5) internal successors, (1653), 6 states have internal predecessors, (1653), 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-08 21:37:23,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:23,603 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] [2025-03-08 21:37:23,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:37:23,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2020750175, now seen corresponding path program 1 times [2025-03-08 21:37:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-08 21:37:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:23,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 21:37:23,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 21:37:23,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:23,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:23,645 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-08 21:37:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-08 21:37:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117633284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:37:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63953744] [2025-03-08 21:37:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:23,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:23,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:23,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:37:23,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-08 21:37:23,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-08 21:37:23,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:23,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-08 21:37:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:24,053 INFO L124 PetriNetUnfolderBase]: 365/3087 cut-off events. [2025-03-08 21:37:24,054 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-08 21:37:24,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3087 events. 365/3087 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26986 event pairs, 204 based on Foata normal form. 1/2670 useless extension candidates. Maximal degree in co-relation 3488. Up to 330 conditions per place. [2025-03-08 21:37:24,092 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-03-08 21:37:24,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 308 transitions, 686 flow [2025-03-08 21:37:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-03-08 21:37:24,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-03-08 21:37:24,094 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 646 flow. Second operand 3 states and 910 transitions. [2025-03-08 21:37:24,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 308 transitions, 686 flow [2025-03-08 21:37:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 308 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:37:24,098 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 648 flow [2025-03-08 21:37:24,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2025-03-08 21:37:24,099 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 21:37:24,099 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 648 flow [2025-03-08 21:37:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 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-08 21:37:24,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:24,099 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] [2025-03-08 21:37:24,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:37:24,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:24,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 319988109, now seen corresponding path program 1 times [2025-03-08 21:37:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-03-08 21:37:24,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:24,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:37:24,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:37:24,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:24,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-03-08 21:37:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41178267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016296513] [2025-03-08 21:37:24,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:24,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:24,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:24,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 21:37:24,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:37:24,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:37:24,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:24,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:24,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 21:37:24,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:37:24,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:37:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016296513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:24,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:37:24,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 21:37:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412633] [2025-03-08 21:37:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:24,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:37:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:24,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:37:24,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:24,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 332 [2025-03-08 21:37:24,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 308 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-08 21:37:24,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:24,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 332 [2025-03-08 21:37:24,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:25,178 INFO L124 PetriNetUnfolderBase]: 1136/6735 cut-off events. [2025-03-08 21:37:25,178 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-03-08 21:37:25,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 6735 events. 1136/6735 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 70769 event pairs, 690 based on Foata normal form. 40/5788 useless extension candidates. Maximal degree in co-relation 8303. Up to 1091 conditions per place. [2025-03-08 21:37:25,298 INFO L140 encePairwiseOnDemand]: 329/332 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-08 21:37:25,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 318 transitions, 741 flow [2025-03-08 21:37:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:37:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:37:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-03-08 21:37:25,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2025-03-08 21:37:25,300 INFO L175 Difference]: Start difference. First operand has 302 places, 308 transitions, 648 flow. Second operand 3 states and 918 transitions. [2025-03-08 21:37:25,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 318 transitions, 741 flow [2025-03-08 21:37:25,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 318 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:25,305 INFO L231 Difference]: Finished difference. Result has 304 places, 309 transitions, 658 flow [2025-03-08 21:37:25,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=304, PETRI_TRANSITIONS=309} [2025-03-08 21:37:25,305 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-08 21:37:25,306 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 309 transitions, 658 flow [2025-03-08 21:37:25,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-08 21:37:25,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:25,306 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:25,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 21:37:25,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:25,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:25,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2076401757, now seen corresponding path program 1 times [2025-03-08 21:37:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:25,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-08 21:37:25,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:25,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:37:25,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:37:25,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-08 21:37:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798448606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:25,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968042570] [2025-03-08 21:37:25,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:25,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:25,564 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:25,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 21:37:25,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:37:25,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:37:25,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:25,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:25,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:37:25,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:25,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:25,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968042570] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:25,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:25,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:37:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141006218] [2025-03-08 21:37:25,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:25,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:37:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:25,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:37:25,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:37:25,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-08 21:37:25,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 658 flow. Second operand has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-08 21:37:25,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:25,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-08 21:37:25,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:26,311 INFO L124 PetriNetUnfolderBase]: 366/3121 cut-off events. [2025-03-08 21:37:26,311 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-08 21:37:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 3121 events. 366/3121 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26782 event pairs, 204 based on Foata normal form. 2/2699 useless extension candidates. Maximal degree in co-relation 3504. Up to 330 conditions per place. [2025-03-08 21:37:26,364 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 20 selfloop transitions, 9 changer transitions 0/317 dead transitions. [2025-03-08 21:37:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 734 flow [2025-03-08 21:37:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:37:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:37:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2677 transitions. [2025-03-08 21:37:26,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959170013386881 [2025-03-08 21:37:26,367 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 658 flow. Second operand 9 states and 2677 transitions. [2025-03-08 21:37:26,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 734 flow [2025-03-08 21:37:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 317 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:26,372 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 706 flow [2025-03-08 21:37:26,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2025-03-08 21:37:26,372 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 2 predicate places. [2025-03-08 21:37:26,372 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 706 flow [2025-03-08 21:37:26,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 296.2) internal successors, (2962), 10 states have internal predecessors, (2962), 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-08 21:37:26,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:26,374 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:26,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 21:37:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:26,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1613897949, now seen corresponding path program 2 times [2025-03-08 21:37:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-08 21:37:26,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:26,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-08 21:37:26,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:37:26,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:26,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861974994] [2025-03-08 21:37:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861974994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:37:26,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025031283] [2025-03-08 21:37:26,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:37:26,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:37:26,715 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:37:26,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 21:37:26,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-08 21:37:26,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 21:37:26,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:37:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:26,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:37:26,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:37:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:26,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:37:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:37:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025031283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:37:26,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:37:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:37:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118981953] [2025-03-08 21:37:26,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:37:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:37:26,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:26,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:37:26,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:37:27,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2025-03-08 21:37:27,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 706 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-08 21:37:27,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:27,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2025-03-08 21:37:27,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:27,486 INFO L124 PetriNetUnfolderBase]: 366/3160 cut-off events. [2025-03-08 21:37:27,486 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-08 21:37:27,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 3160 events. 366/3160 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26710 event pairs, 204 based on Foata normal form. 3/2739 useless extension candidates. Maximal degree in co-relation 3508. Up to 330 conditions per place. [2025-03-08 21:37:27,537 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 23 selfloop transitions, 18 changer transitions 0/329 dead transitions. [2025-03-08 21:37:27,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 329 transitions, 862 flow [2025-03-08 21:37:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 21:37:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 21:37:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5336 transitions. [2025-03-08 21:37:27,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.892904953145917 [2025-03-08 21:37:27,542 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 706 flow. Second operand 18 states and 5336 transitions. [2025-03-08 21:37:27,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 329 transitions, 862 flow [2025-03-08 21:37:27,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 329 transitions, 850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:37:27,548 INFO L231 Difference]: Finished difference. Result has 334 places, 325 transitions, 806 flow [2025-03-08 21:37:27,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=806, PETRI_PLACES=334, PETRI_TRANSITIONS=325} [2025-03-08 21:37:27,549 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 22 predicate places. [2025-03-08 21:37:27,549 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 325 transitions, 806 flow [2025-03-08 21:37:27,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 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-08 21:37:27,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:27,550 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:37:27,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 21:37:27,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:37:27,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-08 21:37:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2133108879, now seen corresponding path program 3 times [2025-03-08 21:37:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475987634] [2025-03-08 21:37:27,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:37:27,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:27,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-03-08 21:37:27,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:37:27,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 21:37:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:27,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:37:27,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 21:37:27,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 21:37:27,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:27,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:37:27,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:37:27,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:37:27,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-08 21:37:27,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-08 21:37:27,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:37:27,814 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-08 21:37:27,815 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:37:27,815 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-08 21:37:27,862 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:37:27,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 402 transitions, 844 flow [2025-03-08 21:37:27,904 INFO L124 PetriNetUnfolderBase]: 36/445 cut-off events. [2025-03-08 21:37:27,904 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-08 21:37:27,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 445 events. 36/445 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1784 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 379. Up to 6 conditions per place. [2025-03-08 21:37:27,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 402 transitions, 844 flow [2025-03-08 21:37:27,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 402 transitions, 844 flow [2025-03-08 21:37:27,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:37:27,915 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;@621c786d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:37:27,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:37:27,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:37:27,917 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-08 21:37:27,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:37:27,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:37:27,917 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] [2025-03-08 21:37:27,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:37:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:37:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1553237538, now seen corresponding path program 1 times [2025-03-08 21:37:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:37:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-03-08 21:37:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:37:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:37:27,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 21:37:27,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 21:37:27,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:37:27,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:37:28,030 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-08 21:37:28,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:37:28,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-03-08 21:37:28,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856203623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:37:28,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:37:28,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:37:28,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190306099] [2025-03-08 21:37:28,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:37:28,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:37:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:37:28,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:37:28,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:37:28,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 402 [2025-03-08 21:37:28,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 402 transitions, 844 flow. Second operand has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 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-08 21:37:28,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:37:28,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 402 [2025-03-08 21:37:28,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:37:56,696 INFO L124 PetriNetUnfolderBase]: 98025/234114 cut-off events. [2025-03-08 21:37:56,696 INFO L125 PetriNetUnfolderBase]: For 43281/43281 co-relation queries the response was YES. [2025-03-08 21:37:59,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360711 conditions, 234114 events. 98025/234114 cut-off events. For 43281/43281 co-relation queries the response was YES. Maximal size of possible extension queue 9651. Compared 3370967 event pairs, 64428 based on Foata normal form. 43303/227901 useless extension candidates. Maximal degree in co-relation 45257. Up to 110246 conditions per place. [2025-03-08 21:38:01,549 INFO L140 encePairwiseOnDemand]: 380/402 looper letters, 41 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-03-08 21:38:01,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 372 transitions, 876 flow [2025-03-08 21:38:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:38:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:38:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2061 transitions. [2025-03-08 21:38:01,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8544776119402985 [2025-03-08 21:38:01,551 INFO L175 Difference]: Start difference. First operand has 377 places, 402 transitions, 844 flow. Second operand 6 states and 2061 transitions. [2025-03-08 21:38:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 372 transitions, 876 flow [2025-03-08 21:38:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 372 transitions, 864 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:01,564 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 782 flow [2025-03-08 21:38:01,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2025-03-08 21:38:01,565 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-03-08 21:38:01,565 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 782 flow [2025-03-08 21:38:01,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 334.5) internal successors, (2007), 6 states have internal predecessors, (2007), 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-08 21:38:01,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:01,566 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] [2025-03-08 21:38:01,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:38:01,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:38:01,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1063619031, now seen corresponding path program 1 times [2025-03-08 21:38:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:01,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165539319] [2025-03-08 21:38:01,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 21:38:01,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 21:38:01,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:01,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:01,586 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-08 21:38:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165539319] [2025-03-08 21:38:01,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165539319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:01,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:01,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:38:01,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570191789] [2025-03-08 21:38:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:01,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:38:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:01,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:38:01,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:38:01,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 402 [2025-03-08 21:38:01,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-08 21:38:01,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:01,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 402 [2025-03-08 21:38:01,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:02,764 INFO L124 PetriNetUnfolderBase]: 1337/9459 cut-off events. [2025-03-08 21:38:02,764 INFO L125 PetriNetUnfolderBase]: For 1173/1173 co-relation queries the response was YES. [2025-03-08 21:38:02,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 9459 events. 1337/9459 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 106326 event pairs, 852 based on Foata normal form. 1/8193 useless extension candidates. Maximal degree in co-relation 10994. Up to 1221 conditions per place. [2025-03-08 21:38:02,949 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 19 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-08 21:38:02,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 828 flow [2025-03-08 21:38:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:38:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:38:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-03-08 21:38:02,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137645107794361 [2025-03-08 21:38:02,954 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 782 flow. Second operand 3 states and 1102 transitions. [2025-03-08 21:38:02,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 828 flow [2025-03-08 21:38:02,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 373 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:38:02,960 INFO L231 Difference]: Finished difference. Result has 365 places, 373 transitions, 784 flow [2025-03-08 21:38:02,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=365, PETRI_TRANSITIONS=373} [2025-03-08 21:38:02,961 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -12 predicate places. [2025-03-08 21:38:02,961 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 373 transitions, 784 flow [2025-03-08 21:38:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-08 21:38:02,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:02,961 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] [2025-03-08 21:38:02,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:38:02,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:38:02,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1139976899, now seen corresponding path program 1 times [2025-03-08 21:38:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-03-08 21:38:02,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:02,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:38:02,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:38:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:02,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:03,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671626688] [2025-03-08 21:38:03,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671626688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:38:03,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960967326] [2025-03-08 21:38:03,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:38:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:38:03,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:38:03,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 21:38:03,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:38:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:38:03,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:03,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 21:38:03,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:38:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:38:03,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:38:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960967326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:38:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 21:38:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319012543] [2025-03-08 21:38:03,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:38:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:03,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:38:03,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:38:03,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 402 [2025-03-08 21:38:03,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 373 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:03,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:03,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 402 [2025-03-08 21:38:03,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:06,178 INFO L124 PetriNetUnfolderBase]: 4346/23625 cut-off events. [2025-03-08 21:38:06,178 INFO L125 PetriNetUnfolderBase]: For 2702/2702 co-relation queries the response was YES. [2025-03-08 21:38:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29292 conditions, 23625 events. 4346/23625 cut-off events. For 2702/2702 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 310121 event pairs, 2796 based on Foata normal form. 121/20356 useless extension candidates. Maximal degree in co-relation 29243. Up to 4007 conditions per place. [2025-03-08 21:38:06,574 INFO L140 encePairwiseOnDemand]: 399/402 looper letters, 33 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-03-08 21:38:06,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 386 transitions, 900 flow [2025-03-08 21:38:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:38:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:38:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2025-03-08 21:38:06,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2025-03-08 21:38:06,575 INFO L175 Difference]: Start difference. First operand has 365 places, 373 transitions, 784 flow. Second operand 3 states and 1113 transitions. [2025-03-08 21:38:06,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 386 transitions, 900 flow [2025-03-08 21:38:06,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:38:06,586 INFO L231 Difference]: Finished difference. Result has 367 places, 374 transitions, 794 flow [2025-03-08 21:38:06,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=367, PETRI_TRANSITIONS=374} [2025-03-08 21:38:06,587 INFO L279 CegarLoopForPetriNet]: 377 programPoint places, -10 predicate places. [2025-03-08 21:38:06,587 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 374 transitions, 794 flow [2025-03-08 21:38:06,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:06,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:06,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:06,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 21:38:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 21:38:06,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:38:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash -615899355, now seen corresponding path program 1 times [2025-03-08 21:38:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-03-08 21:38:06,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:06,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:38:06,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:38:06,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:06,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:38:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-03-08 21:38:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574890472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:38:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135332934] [2025-03-08 21:38:06,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:06,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:38:06,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:38:06,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:38:06,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 21:38:06,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:38:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:38:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:06,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:38:06,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:38:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:38:06,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:38:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:38:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135332934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:38:06,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:38:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:38:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324767857] [2025-03-08 21:38:06,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:38:06,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:38:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:06,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:38:06,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:38:07,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 402 [2025-03-08 21:38:07,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 374 transitions, 794 flow. Second operand has 10 states, 10 states have (on average 358.9) internal successors, (3589), 10 states have internal predecessors, (3589), 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-08 21:38:07,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:07,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 402 [2025-03-08 21:38:07,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:08,702 INFO L124 PetriNetUnfolderBase]: 1338/9493 cut-off events. [2025-03-08 21:38:08,702 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-03-08 21:38:08,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11107 conditions, 9493 events. 1338/9493 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 106340 event pairs, 852 based on Foata normal form. 2/8221 useless extension candidates. Maximal degree in co-relation 11010. Up to 1221 conditions per place.