./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.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/05-lval_ls_01-idx_rc.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 881804847426e60812f8175456032b889bbad15c60068b15698c7277211e0c6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:35:13,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:13,941 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:13,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:13,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:13,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:13,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:13,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:13,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:13,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:13,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:13,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:13,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:13,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:13,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:13,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:13,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:13,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:13,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:13,973 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 -> 881804847426e60812f8175456032b889bbad15c60068b15698c7277211e0c6e [2025-03-14 01:35:14,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:14,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:14,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:14,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:14,208 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:14,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.i [2025-03-14 01:35:15,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef244ed1/29e852a4be9a408eaa260be93c3cecfe/FLAGf376ecced [2025-03-14 01:35:15,657 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:15,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_01-idx_rc.i [2025-03-14 01:35:15,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef244ed1/29e852a4be9a408eaa260be93c3cecfe/FLAGf376ecced [2025-03-14 01:35:15,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef244ed1/29e852a4be9a408eaa260be93c3cecfe [2025-03-14 01:35:15,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:15,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:15,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:15,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:15,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:15,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:15" (1/1) ... [2025-03-14 01:35:15,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f1e6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:15, skipping insertion in model container [2025-03-14 01:35:15,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:15" (1/1) ... [2025-03-14 01:35:15,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:15,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:16,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:16,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:16,074 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:16,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:16 WrapperNode [2025-03-14 01:35:16,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:16,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:16,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:16,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:16,081 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:16" (1/1) ... [2025-03-14 01:35:16,094 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:16" (1/1) ... [2025-03-14 01:35:16,122 INFO L138 Inliner]: procedures = 162, calls = 58, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 88 [2025-03-14 01:35:16,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:16,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:16,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:16,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:16,129 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:16" (1/1) ... [2025-03-14 01:35:16,131 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:16" (1/1) ... [2025-03-14 01:35:16,135 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:16" (1/1) ... [2025-03-14 01:35:16,136 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:16" (1/1) ... [2025-03-14 01:35:16,145 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:16" (1/1) ... [2025-03-14 01:35:16,146 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:16" (1/1) ... [2025-03-14 01:35:16,151 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:16" (1/1) ... [2025-03-14 01:35:16,152 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:16" (1/1) ... [2025-03-14 01:35:16,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:16,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:16,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:16,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:16,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:16" (1/1) ... [2025-03-14 01:35:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:16,191 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:16,193 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:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:16,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:16,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:16,215 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:16,300 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:16,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:16,492 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:16,493 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:16,493 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:16,515 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:16,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:16 BoogieIcfgContainer [2025-03-14 01:35:16,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:16,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:16,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:16,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:16,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:15" (1/3) ... [2025-03-14 01:35:16,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bb2b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:16, skipping insertion in model container [2025-03-14 01:35:16,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:16" (2/3) ... [2025-03-14 01:35:16,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10bb2b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:16, skipping insertion in model container [2025-03-14 01:35:16,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:16" (3/3) ... [2025-03-14 01:35:16,522 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_01-idx_rc.i [2025-03-14 01:35:16,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:16,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_01-idx_rc.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-14 01:35:16,533 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:16,587 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:35:16,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 110 transitions, 224 flow [2025-03-14 01:35:16,671 INFO L124 PetriNetUnfolderBase]: 1/109 cut-off events. [2025-03-14 01:35:16,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:16,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-14 01:35:16,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 110 transitions, 224 flow [2025-03-14 01:35:16,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 109 transitions, 221 flow [2025-03-14 01:35:16,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:16,705 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;@45d490ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:16,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 01:35:16,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:16,727 INFO L124 PetriNetUnfolderBase]: 1/79 cut-off events. [2025-03-14 01:35:16,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:16,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:16,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:16,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:16,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1450300205, now seen corresponding path program 1 times [2025-03-14 01:35:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602468151] [2025-03-14 01:35:16,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:16,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-14 01:35:16,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-14 01:35:16,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:16,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:17,037 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:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602468151] [2025-03-14 01:35:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602468151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:17,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:35:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470351074] [2025-03-14 01:35:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:17,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:17,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:17,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:17,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 110 [2025-03-14 01:35:17,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:17,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:17,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 110 [2025-03-14 01:35:17,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:17,148 INFO L124 PetriNetUnfolderBase]: 7/170 cut-off events. [2025-03-14 01:35:17,148 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:17,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 170 events. 7/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 257 event pairs, 6 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 113. Up to 24 conditions per place. [2025-03-14 01:35:17,150 INFO L140 encePairwiseOnDemand]: 107/110 looper letters, 10 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-14 01:35:17,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 247 flow [2025-03-14 01:35:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2025-03-14 01:35:17,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2025-03-14 01:35:17,161 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 221 flow. Second operand 3 states and 310 transitions. [2025-03-14 01:35:17,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 247 flow [2025-03-14 01:35:17,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 110 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:17,168 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 232 flow [2025-03-14 01:35:17,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2025-03-14 01:35:17,174 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2025-03-14 01:35:17,176 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 232 flow [2025-03-14 01:35:17,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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:17,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:17,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:17,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:17,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:17,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -397719070, now seen corresponding path program 1 times [2025-03-14 01:35:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666109080] [2025-03-14 01:35:17,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:17,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:35:17,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:35:17,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:17,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:17,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666109080] [2025-03-14 01:35:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666109080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801057649] [2025-03-14 01:35:17,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:17,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:17,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:35:17,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-14 01:35:17,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-14 01:35:17,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:17,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:17,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:35:17,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:35:17,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:35:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801057649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:35:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:35:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114958770] [2025-03-14 01:35:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:17,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:17,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:17,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:17,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2025-03-14 01:35:17,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:17,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:17,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2025-03-14 01:35:17,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:17,585 INFO L124 PetriNetUnfolderBase]: 32/259 cut-off events. [2025-03-14 01:35:17,586 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:17,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 259 events. 32/259 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 888 event pairs, 13 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 280. Up to 44 conditions per place. [2025-03-14 01:35:17,587 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 17 selfloop transitions, 6 changer transitions 0/120 dead transitions. [2025-03-14 01:35:17,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 120 transitions, 298 flow [2025-03-14 01:35:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2025-03-14 01:35:17,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575757575757575 [2025-03-14 01:35:17,590 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 232 flow. Second operand 3 states and 316 transitions. [2025-03-14 01:35:17,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 120 transitions, 298 flow [2025-03-14 01:35:17,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:17,592 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 282 flow [2025-03-14 01:35:17,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-03-14 01:35:17,593 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2025-03-14 01:35:17,593 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 282 flow [2025-03-14 01:35:17,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:17,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:17,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:17,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:35:17,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:17,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:17,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1375564877, now seen corresponding path program 1 times [2025-03-14 01:35:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936378816] [2025-03-14 01:35:17,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:17,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:35:17,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:35:17,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:17,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936378816] [2025-03-14 01:35:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936378816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117772166] [2025-03-14 01:35:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:17,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:17,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:17,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:35:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:35:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:35:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:17,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:35:17,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:35:18,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:35:18,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117772166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:18,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:35:18,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:35:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495659900] [2025-03-14 01:35:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:18,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:18,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 110 [2025-03-14 01:35:18,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:18,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:18,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 110 [2025-03-14 01:35:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:18,100 INFO L124 PetriNetUnfolderBase]: 47/319 cut-off events. [2025-03-14 01:35:18,101 INFO L125 PetriNetUnfolderBase]: For 89/94 co-relation queries the response was YES. [2025-03-14 01:35:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 319 events. 47/319 cut-off events. For 89/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1324 event pairs, 21 based on Foata normal form. 3/304 useless extension candidates. Maximal degree in co-relation 451. Up to 86 conditions per place. [2025-03-14 01:35:18,105 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 16 selfloop transitions, 7 changer transitions 1/123 dead transitions. [2025-03-14 01:35:18,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 123 transitions, 354 flow [2025-03-14 01:35:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-14 01:35:18,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424242424242424 [2025-03-14 01:35:18,109 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 282 flow. Second operand 3 states and 311 transitions. [2025-03-14 01:35:18,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 123 transitions, 354 flow [2025-03-14 01:35:18,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 123 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:18,112 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 326 flow [2025-03-14 01:35:18,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-03-14 01:35:18,113 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 7 predicate places. [2025-03-14 01:35:18,113 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 326 flow [2025-03-14 01:35:18,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:18,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:18,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:18,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:35:18,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-14 01:35:18,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:18,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 240725878, now seen corresponding path program 1 times [2025-03-14 01:35:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425980428] [2025-03-14 01:35:18,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:18,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:35:18,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:35:18,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:18,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425980428] [2025-03-14 01:35:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425980428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486799494] [2025-03-14 01:35:18,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:18,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:18,438 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:18,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:35:18,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-14 01:35:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-14 01:35:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:18,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 01:35:18,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:35:18,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:35:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486799494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:35:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-14 01:35:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587566118] [2025-03-14 01:35:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:18,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:18,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:18,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:18,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 110 [2025-03-14 01:35:18,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:18,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:18,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 110 [2025-03-14 01:35:18,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:18,613 INFO L124 PetriNetUnfolderBase]: 66/386 cut-off events. [2025-03-14 01:35:18,613 INFO L125 PetriNetUnfolderBase]: For 214/222 co-relation queries the response was YES. [2025-03-14 01:35:18,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 386 events. 66/386 cut-off events. For 214/222 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1758 event pairs, 25 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 650. Up to 115 conditions per place. [2025-03-14 01:35:18,616 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 17 selfloop transitions, 7 changer transitions 7/128 dead transitions. [2025-03-14 01:35:18,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 128 transitions, 412 flow [2025-03-14 01:35:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-14 01:35:18,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9303030303030303 [2025-03-14 01:35:18,619 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 326 flow. Second operand 3 states and 307 transitions. [2025-03-14 01:35:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 128 transitions, 412 flow [2025-03-14 01:35:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 128 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:18,625 INFO L231 Difference]: Finished difference. Result has 121 places, 120 transitions, 344 flow [2025-03-14 01:35:18,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=121, PETRI_TRANSITIONS=120} [2025-03-14 01:35:18,626 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 9 predicate places. [2025-03-14 01:35:18,626 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 120 transitions, 344 flow [2025-03-14 01:35:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:18,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:18,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:35:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:35:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:18,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -526456405, now seen corresponding path program 1 times [2025-03-14 01:35:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10498116] [2025-03-14 01:35:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:18,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-14 01:35:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-14 01:35:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:18,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10498116] [2025-03-14 01:35:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10498116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:18,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557803688] [2025-03-14 01:35:18,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:18,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:18,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:35:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-14 01:35:19,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-14 01:35:19,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:19,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:19,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:35:19,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:19,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:19,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557803688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:19,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:19,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:35:19,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187249434] [2025-03-14 01:35:19,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:19,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:35:19,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:19,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:35:19,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:35:19,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-14 01:35:19,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 120 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 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:19,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:19,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-14 01:35:19,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:19,231 INFO L124 PetriNetUnfolderBase]: 25/318 cut-off events. [2025-03-14 01:35:19,231 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-14 01:35:19,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 318 events. 25/318 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1301 event pairs, 10 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 461. Up to 37 conditions per place. [2025-03-14 01:35:19,232 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 14 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-14 01:35:19,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 128 transitions, 408 flow [2025-03-14 01:35:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:35:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:35:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions. [2025-03-14 01:35:19,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.897979797979798 [2025-03-14 01:35:19,235 INFO L175 Difference]: Start difference. First operand has 121 places, 120 transitions, 344 flow. Second operand 9 states and 889 transitions. [2025-03-14 01:35:19,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 128 transitions, 408 flow [2025-03-14 01:35:19,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 128 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:35:19,238 INFO L231 Difference]: Finished difference. Result has 130 places, 126 transitions, 380 flow [2025-03-14 01:35:19,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=130, PETRI_TRANSITIONS=126} [2025-03-14 01:35:19,239 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 18 predicate places. [2025-03-14 01:35:19,239 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 126 transitions, 380 flow [2025-03-14 01:35:19,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 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:19,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:19,240 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:35:19,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:19,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:19,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2084017247, now seen corresponding path program 2 times [2025-03-14 01:35:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953276351] [2025-03-14 01:35:19,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:19,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:35:19,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:35:19,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:35:19,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953276351] [2025-03-14 01:35:19,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953276351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:19,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397032255] [2025-03-14 01:35:19,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:19,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:19,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:19,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:19,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:35:19,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:35:19,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:35:19,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:35:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:19,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:35:19,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:19,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397032255] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:19,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:35:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559377358] [2025-03-14 01:35:19,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:35:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:19,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:35:19,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:35:19,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-14 01:35:19,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 126 transitions, 380 flow. Second operand has 18 states, 18 states have (on average 98.05555555555556) internal successors, (1765), 18 states have internal predecessors, (1765), 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:19,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:19,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-14 01:35:19,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:20,086 INFO L124 PetriNetUnfolderBase]: 25/338 cut-off events. [2025-03-14 01:35:20,088 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-14 01:35:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 338 events. 25/338 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 10 based on Foata normal form. 4/331 useless extension candidates. Maximal degree in co-relation 442. Up to 37 conditions per place. [2025-03-14 01:35:20,090 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 18 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2025-03-14 01:35:20,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 554 flow [2025-03-14 01:35:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:35:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:35:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2059 transitions. [2025-03-14 01:35:20,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913419913419913 [2025-03-14 01:35:20,096 INFO L175 Difference]: Start difference. First operand has 130 places, 126 transitions, 380 flow. Second operand 21 states and 2059 transitions. [2025-03-14 01:35:20,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 554 flow [2025-03-14 01:35:20,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 540 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:20,102 INFO L231 Difference]: Finished difference. Result has 154 places, 139 transitions, 504 flow [2025-03-14 01:35:20,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=504, PETRI_PLACES=154, PETRI_TRANSITIONS=139} [2025-03-14 01:35:20,103 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 42 predicate places. [2025-03-14 01:35:20,105 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 139 transitions, 504 flow [2025-03-14 01:35:20,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 98.05555555555556) internal successors, (1765), 18 states have internal predecessors, (1765), 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:20,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:20,106 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:35:20,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:20,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1618166901, now seen corresponding path program 3 times [2025-03-14 01:35:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661890324] [2025-03-14 01:35:20,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:35:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:20,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-03-14 01:35:20,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:35:20,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:35:20,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:20,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:20,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661890324] [2025-03-14 01:35:20,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661890324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:20,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609248011] [2025-03-14 01:35:20,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:35:20,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:20,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:35:20,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:35:20,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-03-14 01:35:20,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:35:20,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-14 01:35:20,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:20,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-14 01:35:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:20,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609248011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:21,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:21,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:35:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249835096] [2025-03-14 01:35:21,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:35:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:21,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:35:21,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:35:21,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 110 [2025-03-14 01:35:21,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 139 transitions, 504 flow. Second operand has 23 states, 23 states have (on average 98.1304347826087) internal successors, (2257), 23 states have internal predecessors, (2257), 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:21,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:21,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 110 [2025-03-14 01:35:21,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:21,523 INFO L124 PetriNetUnfolderBase]: 25/353 cut-off events. [2025-03-14 01:35:21,524 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2025-03-14 01:35:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 353 events. 25/353 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 10 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 446. Up to 37 conditions per place. [2025-03-14 01:35:21,525 INFO L140 encePairwiseOnDemand]: 104/110 looper letters, 21 selfloop transitions, 30 changer transitions 0/156 dead transitions. [2025-03-14 01:35:21,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 156 transitions, 734 flow [2025-03-14 01:35:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:35:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:35:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2934 transitions. [2025-03-14 01:35:21,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889090909090909 [2025-03-14 01:35:21,531 INFO L175 Difference]: Start difference. First operand has 154 places, 139 transitions, 504 flow. Second operand 30 states and 2934 transitions. [2025-03-14 01:35:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 156 transitions, 734 flow [2025-03-14 01:35:21,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 156 transitions, 704 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-14 01:35:21,535 INFO L231 Difference]: Finished difference. Result has 181 places, 149 transitions, 632 flow [2025-03-14 01:35:21,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=632, PETRI_PLACES=181, PETRI_TRANSITIONS=149} [2025-03-14 01:35:21,536 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 69 predicate places. [2025-03-14 01:35:21,536 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 149 transitions, 632 flow [2025-03-14 01:35:21,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 98.1304347826087) internal successors, (2257), 23 states have internal predecessors, (2257), 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:21,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:21,538 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:35:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:21,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -714045418, now seen corresponding path program 4 times [2025-03-14 01:35:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599162999] [2025-03-14 01:35:21,739 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:35:21,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:21,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 130 statements into 2 equivalence classes. [2025-03-14 01:35:21,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-14 01:35:21,765 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:35:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:21,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:35:21,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-14 01:35:21,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-14 01:35:21,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:21,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:21,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:35:21,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:35:21,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-14 01:35:21,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-14 01:35:21,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 01:35:21,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-14 01:35:21,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-14 01:35:21,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-14 01:35:21,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-14 01:35:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:35:21,808 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-03-14 01:35:21,851 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:35:21,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:35:21,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:35:21 BasicIcfg [2025-03-14 01:35:21,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:35:21,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:35:21,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:35:21,858 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:35:21,859 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:16" (3/4) ... [2025-03-14 01:35:21,860 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:35:21,915 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-14 01:35:21,953 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:35:21,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:35:21,956 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:35:21,956 INFO L158 Benchmark]: Toolchain (without parser) took 6256.32ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 111.8MB in the beginning and 266.4MB in the end (delta: -154.5MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,957 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.30ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 90.8MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.52ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: Boogie Preprocessor took 34.77ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 87.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: IcfgBuilder took 357.84ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 70.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: TraceAbstraction took 5340.45ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.6MB in the beginning and 274.7MB in the end (delta: -205.1MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,958 INFO L158 Benchmark]: Witness Printer took 97.80ms. Allocated memory is still 419.4MB. Free memory was 274.7MB in the beginning and 266.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:21,960 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.15ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.30ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 90.8MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.52ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.77ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 87.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.84ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 70.1MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5340.45ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 69.6MB in the beginning and 274.7MB in the end (delta: -205.1MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. * Witness Printer took 97.80ms. Allocated memory is still 419.4MB. Free memory was 274.7MB in the beginning and 266.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int data; VAL [data=0] [L680] 0 pthread_mutex_t m[10]; VAL [data=0, m={1:0}] [L688] 0 int i = 0; VAL [data=0, i=0, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=1, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=2, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=3, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=4, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=5, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=6, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=7, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=8, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=9, m={1:0}] [L688] COND TRUE 0 i < 10 VAL [data=0, m={1:0}] [L688] 0 i++ VAL [data=0, i=10, m={1:0}] [L688] COND FALSE 0 !(i < 10) VAL [data=0, m={1:0}] [L690] 0 pthread_t id; VAL [data=0, m={1:0}] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data=0, id=-1, m={1:0}] [L683] 1 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, m={1:0}] [L693] 0 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, id=-1, m={1:0}] [L683] 1 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=1, m={1:0}] [L693] 0 data++ VAL [\old(arg)={0:0}, arg={0:0}, data=1, id=-1, m={1:0}] Now there is a data race on ~data~0 between C: data++ [683] and C: data++ [693] - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 683]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 130 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.2s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 23 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 797 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=7, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1262 NumberOfCodeBlocks, 1262 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1411 ConstructedInterpolants, 0 QuantifiedInterpolants, 1803 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1134 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3/399 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-14 01:35:21,975 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)