./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/goblint-regression/04-mutex_42-trylock_2mutex.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 29686c593874684b7702dd35cbbbd25416d0d0dde1b2c7e324de66da32235cfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:35:05,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:06,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:06,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:06,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:06,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:06,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:06,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:06,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:06,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:06,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:06,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:06,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:06,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:06,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:06,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:06,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:06,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:06,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:06,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:06,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:06,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:06,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:06,040 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 -> 29686c593874684b7702dd35cbbbd25416d0d0dde1b2c7e324de66da32235cfd [2025-03-14 01:35:06,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:06,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:06,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:06,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:06,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:06,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-14 01:35:07,537 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f63f69e/9244c26717644f539bdbd1e6d6667990/FLAG4d79e3bf7 [2025-03-14 01:35:07,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:07,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-14 01:35:07,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f63f69e/9244c26717644f539bdbd1e6d6667990/FLAG4d79e3bf7 [2025-03-14 01:35:07,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f63f69e/9244c26717644f539bdbd1e6d6667990 [2025-03-14 01:35:07,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:07,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:07,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:07,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:07,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:07,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:07" (1/1) ... [2025-03-14 01:35:07,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f204a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:07, skipping insertion in model container [2025-03-14 01:35:07,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:07" (1/1) ... [2025-03-14 01:35:07,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:08,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:08,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:08,182 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:08,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08 WrapperNode [2025-03-14 01:35:08,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:08,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:08,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:08,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:08,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,220 INFO L138 Inliner]: procedures = 163, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-03-14 01:35:08,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:08,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:08,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:08,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:08,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:08,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:08,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:08,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:08,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (1/1) ... [2025-03-14 01:35:08,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:08,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:08,279 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-14 01:35:08,282 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-14 01:35:08,299 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:08,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:08,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:08,301 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:08,405 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:08,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:08,585 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:08,586 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:08,586 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:08,628 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:08,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:08 BoogieIcfgContainer [2025-03-14 01:35:08,628 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:08,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:08,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:08,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:08,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:07" (1/3) ... [2025-03-14 01:35:08,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c891660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:08, skipping insertion in model container [2025-03-14 01:35:08,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:08" (2/3) ... [2025-03-14 01:35:08,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c891660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:08, skipping insertion in model container [2025-03-14 01:35:08,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:08" (3/3) ... [2025-03-14 01:35:08,636 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_42-trylock_2mutex.i [2025-03-14 01:35:08,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:08,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_42-trylock_2mutex.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-14 01:35:08,649 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:08,695 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:35:08,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 91 transitions, 189 flow [2025-03-14 01:35:08,769 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2025-03-14 01:35:08,771 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:08,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 2/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2025-03-14 01:35:08,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 91 transitions, 189 flow [2025-03-14 01:35:08,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 85 transitions, 173 flow [2025-03-14 01:35:08,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:08,798 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;@13d5af1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:08,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:35:08,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:08,814 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-14 01:35:08,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:08,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:08,815 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] [2025-03-14 01:35:08,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -669622317, now seen corresponding path program 1 times [2025-03-14 01:35:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252939938] [2025-03-14 01:35:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:08,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:35:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:35:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:09,051 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-14 01:35:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252939938] [2025-03-14 01:35:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252939938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:09,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53526870] [2025-03-14 01:35:09,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:09,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:09,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:09,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-03-14 01:35:09,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-14 01:35:09,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:09,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-03-14 01:35:09,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:09,278 INFO L124 PetriNetUnfolderBase]: 56/374 cut-off events. [2025-03-14 01:35:09,280 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:09,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 374 events. 56/374 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1832 event pairs, 37 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 476. Up to 98 conditions per place. [2025-03-14 01:35:09,285 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 21 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-03-14 01:35:09,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 239 flow [2025-03-14 01:35:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-14 01:35:09,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-14 01:35:09,300 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 173 flow. Second operand 3 states and 247 transitions. [2025-03-14 01:35:09,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 239 flow [2025-03-14 01:35:09,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:09,308 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 200 flow [2025-03-14 01:35:09,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-03-14 01:35:09,315 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2025-03-14 01:35:09,316 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 200 flow [2025-03-14 01:35:09,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-14 01:35:09,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:09,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:09,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:09,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:09,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash -843747773, now seen corresponding path program 1 times [2025-03-14 01:35:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925916540] [2025-03-14 01:35:09,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:09,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:35:09,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:35:09,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:09,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:09,393 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-14 01:35:09,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925916540] [2025-03-14 01:35:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925916540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:09,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805073161] [2025-03-14 01:35:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:09,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:09,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:09,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:09,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:09,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2025-03-14 01:35:09,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-14 01:35:09,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:09,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2025-03-14 01:35:09,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:09,541 INFO L124 PetriNetUnfolderBase]: 64/409 cut-off events. [2025-03-14 01:35:09,542 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:35:09,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 409 events. 64/409 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2053 event pairs, 28 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 574. Up to 81 conditions per place. [2025-03-14 01:35:09,546 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 26 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-03-14 01:35:09,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 99 transitions, 284 flow [2025-03-14 01:35:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-14 01:35:09,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-03-14 01:35:09,549 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 200 flow. Second operand 3 states and 245 transitions. [2025-03-14 01:35:09,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 99 transitions, 284 flow [2025-03-14 01:35:09,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 99 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:09,551 INFO L231 Difference]: Finished difference. Result has 91 places, 89 transitions, 220 flow [2025-03-14 01:35:09,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=89} [2025-03-14 01:35:09,553 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 4 predicate places. [2025-03-14 01:35:09,553 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 220 flow [2025-03-14 01:35:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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-14 01:35:09,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:09,554 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-14 01:35:09,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:35:09,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1431349204, now seen corresponding path program 1 times [2025-03-14 01:35:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285347259] [2025-03-14 01:35:09,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:09,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:35:09,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:35:09,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:09,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:09,628 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-14 01:35:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285347259] [2025-03-14 01:35:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285347259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:09,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:09,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041231245] [2025-03-14 01:35:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:09,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:09,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:09,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:09,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2025-03-14 01:35:09,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-14 01:35:09,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:09,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2025-03-14 01:35:09,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:09,742 INFO L124 PetriNetUnfolderBase]: 82/459 cut-off events. [2025-03-14 01:35:09,743 INFO L125 PetriNetUnfolderBase]: For 39/44 co-relation queries the response was YES. [2025-03-14 01:35:09,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 459 events. 82/459 cut-off events. For 39/44 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2483 event pairs, 57 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 705. Up to 150 conditions per place. [2025-03-14 01:35:09,748 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 24 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2025-03-14 01:35:09,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 98 transitions, 298 flow [2025-03-14 01:35:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-03-14 01:35:09,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-03-14 01:35:09,750 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 220 flow. Second operand 3 states and 241 transitions. [2025-03-14 01:35:09,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 98 transitions, 298 flow [2025-03-14 01:35:09,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:09,754 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 248 flow [2025-03-14 01:35:09,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2025-03-14 01:35:09,755 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2025-03-14 01:35:09,756 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 248 flow [2025-03-14 01:35:09,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-14 01:35:09,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:09,756 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] [2025-03-14 01:35:09,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:35:09,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:09,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -46161792, now seen corresponding path program 1 times [2025-03-14 01:35:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:09,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123024763] [2025-03-14 01:35:09,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:35:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:35:09,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:09,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:09,821 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-14 01:35:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123024763] [2025-03-14 01:35:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123024763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88339918] [2025-03-14 01:35:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:09,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:09,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:09,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2025-03-14 01:35:09,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-14 01:35:09,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:09,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2025-03-14 01:35:09,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:09,948 INFO L124 PetriNetUnfolderBase]: 94/535 cut-off events. [2025-03-14 01:35:09,948 INFO L125 PetriNetUnfolderBase]: For 191/196 co-relation queries the response was YES. [2025-03-14 01:35:09,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 535 events. 94/535 cut-off events. For 191/196 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3004 event pairs, 56 based on Foata normal form. 3/502 useless extension candidates. Maximal degree in co-relation 903. Up to 178 conditions per place. [2025-03-14 01:35:09,951 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 22 selfloop transitions, 8 changer transitions 1/101 dead transitions. [2025-03-14 01:35:09,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 101 transitions, 342 flow [2025-03-14 01:35:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2025-03-14 01:35:09,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8608058608058609 [2025-03-14 01:35:09,954 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 248 flow. Second operand 3 states and 235 transitions. [2025-03-14 01:35:09,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 101 transitions, 342 flow [2025-03-14 01:35:09,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 101 transitions, 326 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:09,958 INFO L231 Difference]: Finished difference. Result has 95 places, 97 transitions, 300 flow [2025-03-14 01:35:09,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=95, PETRI_TRANSITIONS=97} [2025-03-14 01:35:09,960 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-03-14 01:35:09,960 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 97 transitions, 300 flow [2025-03-14 01:35:09,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-14 01:35:09,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:09,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:35:09,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:09,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1593036186, now seen corresponding path program 1 times [2025-03-14 01:35:09,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823418879] [2025-03-14 01:35:09,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:09,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:35:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:35:09,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:09,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:10,236 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-14 01:35:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823418879] [2025-03-14 01:35:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823418879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:10,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:10,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:35:10,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555407883] [2025-03-14 01:35:10,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:10,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:35:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:10,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:35:10,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:35:10,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2025-03-14 01:35:10,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 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-14 01:35:10,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:10,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2025-03-14 01:35:10,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:10,405 INFO L124 PetriNetUnfolderBase]: 31/262 cut-off events. [2025-03-14 01:35:10,405 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-14 01:35:10,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 262 events. 31/262 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 996 event pairs, 8 based on Foata normal form. 10/256 useless extension candidates. Maximal degree in co-relation 396. Up to 56 conditions per place. [2025-03-14 01:35:10,407 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 11 selfloop transitions, 8 changer transitions 1/85 dead transitions. [2025-03-14 01:35:10,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 85 transitions, 258 flow [2025-03-14 01:35:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:35:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:35:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2025-03-14 01:35:10,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8197802197802198 [2025-03-14 01:35:10,408 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 300 flow. Second operand 5 states and 373 transitions. [2025-03-14 01:35:10,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 85 transitions, 258 flow [2025-03-14 01:35:10,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 228 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-14 01:35:10,410 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 200 flow [2025-03-14 01:35:10,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-03-14 01:35:10,411 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 1 predicate places. [2025-03-14 01:35:10,411 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 200 flow [2025-03-14 01:35:10,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.28571428571429) internal successors, (499), 7 states have internal predecessors, (499), 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-14 01:35:10,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:10,412 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] [2025-03-14 01:35:10,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:35:10,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:10,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:10,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2059559490, now seen corresponding path program 1 times [2025-03-14 01:35:10,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:10,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442274023] [2025-03-14 01:35:10,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:10,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:35:10,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:35:10,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:10,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442274023] [2025-03-14 01:35:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442274023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:10,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:10,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:35:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124155261] [2025-03-14 01:35:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:10,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:10,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:10,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2025-03-14 01:35:10,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-14 01:35:10,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:10,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2025-03-14 01:35:10,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:10,508 INFO L124 PetriNetUnfolderBase]: 71/382 cut-off events. [2025-03-14 01:35:10,508 INFO L125 PetriNetUnfolderBase]: For 65/67 co-relation queries the response was YES. [2025-03-14 01:35:10,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 382 events. 71/382 cut-off events. For 65/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1775 event pairs, 41 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 607. Up to 127 conditions per place. [2025-03-14 01:35:10,510 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 22 selfloop transitions, 3 changer transitions 5/92 dead transitions. [2025-03-14 01:35:10,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 92 transitions, 286 flow [2025-03-14 01:35:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-03-14 01:35:10,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-03-14 01:35:10,511 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 200 flow. Second operand 3 states and 241 transitions. [2025-03-14 01:35:10,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 92 transitions, 286 flow [2025-03-14 01:35:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 273 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:35:10,513 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 209 flow [2025-03-14 01:35:10,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2025-03-14 01:35:10,514 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 2 predicate places. [2025-03-14 01:35:10,514 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 209 flow [2025-03-14 01:35:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-14 01:35:10,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:10,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:10,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:35:10,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2041721559, now seen corresponding path program 1 times [2025-03-14 01:35:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933158902] [2025-03-14 01:35:10,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:10,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:35:10,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:35:10,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:10,694 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-14 01:35:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933158902] [2025-03-14 01:35:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933158902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:10,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:35:10,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104796193] [2025-03-14 01:35:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:10,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:35:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:10,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:35:10,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:35:10,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2025-03-14 01:35:10,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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-14 01:35:10,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:10,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2025-03-14 01:35:10,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:10,903 INFO L124 PetriNetUnfolderBase]: 31/367 cut-off events. [2025-03-14 01:35:10,904 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-14 01:35:10,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 367 events. 31/367 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1792 event pairs, 12 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 562. Up to 64 conditions per place. [2025-03-14 01:35:10,906 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 17 selfloop transitions, 11 changer transitions 5/98 dead transitions. [2025-03-14 01:35:10,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 309 flow [2025-03-14 01:35:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:35:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:35:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 525 transitions. [2025-03-14 01:35:10,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8241758241758241 [2025-03-14 01:35:10,909 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 209 flow. Second operand 7 states and 525 transitions. [2025-03-14 01:35:10,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 309 flow [2025-03-14 01:35:10,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 98 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:10,913 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 256 flow [2025-03-14 01:35:10,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-14 01:35:10,913 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 9 predicate places. [2025-03-14 01:35:10,915 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 256 flow [2025-03-14 01:35:10,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 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-14 01:35:10,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:10,915 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:10,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:35:10,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:10,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2125979623, now seen corresponding path program 2 times [2025-03-14 01:35:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417628041] [2025-03-14 01:35:10,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:10,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:10,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:35:10,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:35:10,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:11,007 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-14 01:35:11,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417628041] [2025-03-14 01:35:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417628041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:11,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:11,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:35:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36311523] [2025-03-14 01:35:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:11,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:35:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:11,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:35:11,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:35:11,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2025-03-14 01:35:11,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-14 01:35:11,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:11,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2025-03-14 01:35:11,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:11,077 INFO L124 PetriNetUnfolderBase]: 22/302 cut-off events. [2025-03-14 01:35:11,077 INFO L125 PetriNetUnfolderBase]: For 84/96 co-relation queries the response was YES. [2025-03-14 01:35:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 302 events. 22/302 cut-off events. For 84/96 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1333 event pairs, 6 based on Foata normal form. 5/303 useless extension candidates. Maximal degree in co-relation 508. Up to 47 conditions per place. [2025-03-14 01:35:11,078 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 13 selfloop transitions, 6 changer transitions 15/100 dead transitions. [2025-03-14 01:35:11,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 378 flow [2025-03-14 01:35:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:35:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:35:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 314 transitions. [2025-03-14 01:35:11,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8626373626373627 [2025-03-14 01:35:11,080 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 256 flow. Second operand 4 states and 314 transitions. [2025-03-14 01:35:11,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 378 flow [2025-03-14 01:35:11,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 100 transitions, 365 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-14 01:35:11,082 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 256 flow [2025-03-14 01:35:11,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2025-03-14 01:35:11,082 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2025-03-14 01:35:11,083 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 256 flow [2025-03-14 01:35:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-14 01:35:11,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:11,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:35:11,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-14 01:35:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1901851331, now seen corresponding path program 3 times [2025-03-14 01:35:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037031984] [2025-03-14 01:35:11,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:35:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:11,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:35:11,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:35:11,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:35:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:11,169 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-14 01:35:11,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:11,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037031984] [2025-03-14 01:35:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037031984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:11,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:11,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:35:11,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558290556] [2025-03-14 01:35:11,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:35:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:11,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:35:11,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:35:11,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 91 [2025-03-14 01:35:11,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-14 01:35:11,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:11,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 91 [2025-03-14 01:35:11,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:11,221 INFO L124 PetriNetUnfolderBase]: 10/162 cut-off events. [2025-03-14 01:35:11,222 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-14 01:35:11,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 162 events. 10/162 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 423 event pairs, 5 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 309. Up to 25 conditions per place. [2025-03-14 01:35:11,222 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2025-03-14 01:35:11,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 69 transitions, 239 flow [2025-03-14 01:35:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:35:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:35:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2025-03-14 01:35:11,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8296703296703297 [2025-03-14 01:35:11,224 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 256 flow. Second operand 4 states and 302 transitions. [2025-03-14 01:35:11,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 69 transitions, 239 flow [2025-03-14 01:35:11,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 69 transitions, 210 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-14 01:35:11,226 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-03-14 01:35:11,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-03-14 01:35:11,226 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -10 predicate places. [2025-03-14 01:35:11,226 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-03-14 01:35:11,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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-14 01:35:11,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-03-14 01:35:11,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:35:11,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-03-14 01:35:11,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:35:11,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:35:11,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:35:11,232 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:11,235 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:35:11,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:35:11,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:35:11 BasicIcfg [2025-03-14 01:35:11,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:35:11,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:35:11,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:35:11,242 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:35:11,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:08" (3/4) ... [2025-03-14 01:35:11,244 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:35:11,246 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-14 01:35:11,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:35:11,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-14 01:35:11,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-14 01:35:11,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:35:11,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:35:11,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:35:11,303 INFO L158 Benchmark]: Toolchain (without parser) took 3433.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.5MB in the beginning and 125.1MB in the end (delta: -14.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:11,304 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:11,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 90.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:11,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:11,305 INFO L158 Benchmark]: Boogie Preprocessor took 18.08ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.5MB in the end (delta: 888.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:11,306 INFO L158 Benchmark]: IcfgBuilder took 380.13ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 71.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:11,306 INFO L158 Benchmark]: TraceAbstraction took 2611.65ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 70.4MB in the beginning and 130.8MB in the end (delta: -60.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:11,306 INFO L158 Benchmark]: Witness Printer took 60.97ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 125.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:11,307 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.06ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 90.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 89.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.08ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 88.5MB in the end (delta: 888.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 380.13ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 71.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2611.65ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 70.4MB in the beginning and 130.8MB in the end (delta: -60.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.97ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 125.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 684]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 684]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 125 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 379 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 57 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:35:11,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE