./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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_09-idxsense_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 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:19,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:20,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:20,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:20,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:20,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:20,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:20,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:20,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:20,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:20,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:20,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:20,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:20,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:20,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:20,036 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 -> 0e635f0fe47aceede1c472bdc8d824736c973da1578eefbb4d4eeab774d2111f [2025-03-04 06:45:20,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:20,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:20,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:20,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:20,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:20,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-03-04 06:45:21,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affb29f9f/21c5536a81c84dfcbf563663d65c9c87/FLAGd95df925a [2025-03-04 06:45:21,757 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:21,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/05-lval_ls_09-idxsense_rc.i [2025-03-04 06:45:21,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affb29f9f/21c5536a81c84dfcbf563663d65c9c87/FLAGd95df925a [2025-03-04 06:45:21,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affb29f9f/21c5536a81c84dfcbf563663d65c9c87 [2025-03-04 06:45:21,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:21,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:21,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:21,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:21,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:21,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:21" (1/1) ... [2025-03-04 06:45:21,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fad7f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:21, skipping insertion in model container [2025-03-04 06:45:21,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:21" (1/1) ... [2025-03-04 06:45:21,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:22,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:22,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:22,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:22,128 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:22,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22 WrapperNode [2025-03-04 06:45:22,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:22,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:22,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:22,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:22,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,168 INFO L138 Inliner]: procedures = 162, calls = 73, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2025-03-04 06:45:22,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:22,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:22,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:22,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:22,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:22,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:22,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:22,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:22,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (1/1) ... [2025-03-04 06:45:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:22,231 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-04 06:45:22,234 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-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:22,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:22,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:22,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:22,250 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:22,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:22,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:22,587 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:22,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:22,613 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:22,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:22,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22 BoogieIcfgContainer [2025-03-04 06:45:22,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:22,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:22,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:22,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:22,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:21" (1/3) ... [2025-03-04 06:45:22,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c656502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:22, skipping insertion in model container [2025-03-04 06:45:22,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:22" (2/3) ... [2025-03-04 06:45:22,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c656502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:22, skipping insertion in model container [2025-03-04 06:45:22,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22" (3/3) ... [2025-03-04 06:45:22,623 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_09-idxsense_rc.i [2025-03-04 06:45:22,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:22,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_09-idxsense_rc.i that has 2 procedures, 137 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-04 06:45:22,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:22,689 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:22,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 137 transitions, 278 flow [2025-03-04 06:45:22,769 INFO L124 PetriNetUnfolderBase]: 1/136 cut-off events. [2025-03-04 06:45:22,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 136 events. 1/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-03-04 06:45:22,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 137 transitions, 278 flow [2025-03-04 06:45:22,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 275 flow [2025-03-04 06:45:22,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:22,801 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;@19a491cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:22,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 06:45:22,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:22,824 INFO L124 PetriNetUnfolderBase]: 1/98 cut-off events. [2025-03-04 06:45:22,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:22,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:22,825 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-04 06:45:22,826 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-04 06:45:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 201037282, now seen corresponding path program 1 times [2025-03-04 06:45:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:22,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959647306] [2025-03-04 06:45:22,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:22,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:45:22,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:45:22,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:22,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:23,191 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-04 06:45:23,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959647306] [2025-03-04 06:45:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959647306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:23,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:45:23,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368235830] [2025-03-04 06:45:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:23,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:23,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:23,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 137 [2025-03-04 06:45:23,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-04 06:45:23,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:23,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 137 [2025-03-04 06:45:23,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:23,307 INFO L124 PetriNetUnfolderBase]: 7/221 cut-off events. [2025-03-04 06:45:23,308 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:23,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 7/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 336 event pairs, 6 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 153. Up to 24 conditions per place. [2025-03-04 06:45:23,311 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 10 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-03-04 06:45:23,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 301 flow [2025-03-04 06:45:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2025-03-04 06:45:23,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513381995133819 [2025-03-04 06:45:23,328 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 275 flow. Second operand 3 states and 391 transitions. [2025-03-04 06:45:23,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 301 flow [2025-03-04 06:45:23,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 137 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:23,337 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 286 flow [2025-03-04 06:45:23,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-04 06:45:23,342 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 2 predicate places. [2025-03-04 06:45:23,343 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 286 flow [2025-03-04 06:45:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-04 06:45:23,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:23,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:23,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:23,344 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-04 06:45:23,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:23,344 INFO L85 PathProgramCache]: Analyzing trace with hash 280304502, now seen corresponding path program 1 times [2025-03-04 06:45:23,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789119101] [2025-03-04 06:45:23,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:23,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:45:23,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:45:23,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:23,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:23,533 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-04 06:45:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789119101] [2025-03-04 06:45:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789119101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450935972] [2025-03-04 06:45:23,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:23,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:23,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:23,536 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-04 06:45:23,538 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-04 06:45:23,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:45:23,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:45:23,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:23,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:23,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:45:23,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:23,680 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-04 06:45:23,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:23,721 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-04 06:45:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450935972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:23,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:23,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:45:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395874409] [2025-03-04 06:45:23,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:23,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:45:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:23,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:45:23,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:45:23,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-03-04 06:45:23,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 286 flow. Second operand has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-04 06:45:23,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:23,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-03-04 06:45:23,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:23,870 INFO L124 PetriNetUnfolderBase]: 7/228 cut-off events. [2025-03-04 06:45:23,870 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 228 events. 7/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 331 event pairs, 6 based on Foata normal form. 2/217 useless extension candidates. Maximal degree in co-relation 190. Up to 24 conditions per place. [2025-03-04 06:45:23,871 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 14 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-03-04 06:45:23,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 350 flow [2025-03-04 06:45:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:45:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:45:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1132 transitions. [2025-03-04 06:45:23,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9180859691808597 [2025-03-04 06:45:23,875 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 286 flow. Second operand 9 states and 1132 transitions. [2025-03-04 06:45:23,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 350 flow [2025-03-04 06:45:23,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:23,880 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 334 flow [2025-03-04 06:45:23,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2025-03-04 06:45:23,882 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places. [2025-03-04 06:45:23,882 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 334 flow [2025-03-04 06:45:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.0) internal successors, (1250), 10 states have internal predecessors, (1250), 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-04 06:45:23,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:23,883 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, 1, 1, 1, 1, 1] [2025-03-04 06:45:23,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:45:24,089 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-04 06:45:24,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:24,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash 524455670, now seen corresponding path program 2 times [2025-03-04 06:45:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983945256] [2025-03-04 06:45:24,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:24,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:24,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 06:45:24,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 100 statements. [2025-03-04 06:45:24,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:45:24,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983945256] [2025-03-04 06:45:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983945256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:24,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763252256] [2025-03-04 06:45:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:24,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:24,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:24,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:24,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 137 [2025-03-04 06:45:24,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-04 06:45:24,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:24,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 137 [2025-03-04 06:45:24,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:25,049 INFO L124 PetriNetUnfolderBase]: 261/1003 cut-off events. [2025-03-04 06:45:25,049 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:45:25,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1003 events. 261/1003 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5970 event pairs, 67 based on Foata normal form. 0/966 useless extension candidates. Maximal degree in co-relation 1492. Up to 257 conditions per place. [2025-03-04 06:45:25,054 INFO L140 encePairwiseOnDemand]: 115/137 looper letters, 88 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2025-03-04 06:45:25,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 245 transitions, 798 flow [2025-03-04 06:45:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2025-03-04 06:45:25,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9562043795620438 [2025-03-04 06:45:25,056 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 334 flow. Second operand 6 states and 786 transitions. [2025-03-04 06:45:25,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 245 transitions, 798 flow [2025-03-04 06:45:25,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 245 transitions, 792 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:25,062 INFO L231 Difference]: Finished difference. Result has 160 places, 189 transitions, 644 flow [2025-03-04 06:45:25,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=160, PETRI_TRANSITIONS=189} [2025-03-04 06:45:25,063 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 21 predicate places. [2025-03-04 06:45:25,063 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 189 transitions, 644 flow [2025-03-04 06:45:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-04 06:45:25,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:25,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:25,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:25,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:25,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -51353734, now seen corresponding path program 1 times [2025-03-04 06:45:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:25,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958960149] [2025-03-04 06:45:25,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:25,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:45:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:45:25,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:25,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:25,251 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-04 06:45:25,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958960149] [2025-03-04 06:45:25,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958960149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399391417] [2025-03-04 06:45:25,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:25,254 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-04 06:45:25,255 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-04 06:45:25,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:45:25,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:45:25,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:25,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:45:25,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:25,381 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-04 06:45:25,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:25,484 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-04 06:45:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399391417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:25,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:45:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49062558] [2025-03-04 06:45:25,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:25,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:45:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:25,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:45:25,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:45:25,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-03-04 06:45:25,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 189 transitions, 644 flow. Second operand has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 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-04 06:45:25,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:25,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-03-04 06:45:25,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:25,765 INFO L124 PetriNetUnfolderBase]: 123/770 cut-off events. [2025-03-04 06:45:25,766 INFO L125 PetriNetUnfolderBase]: For 129/144 co-relation queries the response was YES. [2025-03-04 06:45:25,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 770 events. 123/770 cut-off events. For 129/144 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4502 event pairs, 41 based on Foata normal form. 4/757 useless extension candidates. Maximal degree in co-relation 1250. Up to 126 conditions per place. [2025-03-04 06:45:25,770 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 18 selfloop transitions, 21 changer transitions 0/207 dead transitions. [2025-03-04 06:45:25,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 207 transitions, 810 flow [2025-03-04 06:45:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:45:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:45:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2626 transitions. [2025-03-04 06:45:25,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9127563434132777 [2025-03-04 06:45:25,774 INFO L175 Difference]: Start difference. First operand has 160 places, 189 transitions, 644 flow. Second operand 21 states and 2626 transitions. [2025-03-04 06:45:25,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 207 transitions, 810 flow [2025-03-04 06:45:25,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:25,780 INFO L231 Difference]: Finished difference. Result has 185 places, 202 transitions, 774 flow [2025-03-04 06:45:25,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=774, PETRI_PLACES=185, PETRI_TRANSITIONS=202} [2025-03-04 06:45:25,781 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 46 predicate places. [2025-03-04 06:45:25,781 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 202 transitions, 774 flow [2025-03-04 06:45:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 125.0) internal successors, (2250), 18 states have internal predecessors, (2250), 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-04 06:45:25,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:25,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:25,788 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-04 06:45:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 06:45:25,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 905784954, now seen corresponding path program 2 times [2025-03-04 06:45:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842614508] [2025-03-04 06:45:25,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:25,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-04 06:45:26,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 128 statements. [2025-03-04 06:45:26,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 06:45:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:26,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842614508] [2025-03-04 06:45:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842614508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980211008] [2025-03-04 06:45:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:26,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:26,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:26,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2025-03-04 06:45:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 202 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-04 06:45:26,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:26,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2025-03-04 06:45:26,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:26,741 INFO L124 PetriNetUnfolderBase]: 417/1422 cut-off events. [2025-03-04 06:45:26,741 INFO L125 PetriNetUnfolderBase]: For 639/674 co-relation queries the response was YES. [2025-03-04 06:45:26,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 1422 events. 417/1422 cut-off events. For 639/674 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9201 event pairs, 108 based on Foata normal form. 21/1426 useless extension candidates. Maximal degree in co-relation 3228. Up to 602 conditions per place. [2025-03-04 06:45:26,748 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 99 selfloop transitions, 53 changer transitions 6/285 dead transitions. [2025-03-04 06:45:26,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 285 transitions, 1442 flow [2025-03-04 06:45:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2025-03-04 06:45:26,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9075425790754258 [2025-03-04 06:45:26,750 INFO L175 Difference]: Start difference. First operand has 185 places, 202 transitions, 774 flow. Second operand 6 states and 746 transitions. [2025-03-04 06:45:26,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 285 transitions, 1442 flow [2025-03-04 06:45:26,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 285 transitions, 1418 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:45:26,760 INFO L231 Difference]: Finished difference. Result has 189 places, 253 transitions, 1256 flow [2025-03-04 06:45:26,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1256, PETRI_PLACES=189, PETRI_TRANSITIONS=253} [2025-03-04 06:45:26,762 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 50 predicate places. [2025-03-04 06:45:26,762 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 253 transitions, 1256 flow [2025-03-04 06:45:26,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.33333333333333) internal successors, (662), 6 states have internal predecessors, (662), 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-04 06:45:26,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:26,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:26,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:26,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash 636619222, now seen corresponding path program 1 times [2025-03-04 06:45:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132222536] [2025-03-04 06:45:26,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:26,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:45:26,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:45:26,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:27,028 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-04 06:45:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132222536] [2025-03-04 06:45:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132222536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565088332] [2025-03-04 06:45:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:27,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:27,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:27,031 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-04 06:45:27,033 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-04 06:45:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:45:27,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:45:27,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:27,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:27,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:45:27,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:27,209 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-04 06:45:27,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:27,400 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-04 06:45:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565088332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:27,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:27,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:45:27,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926792358] [2025-03-04 06:45:27,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:45:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:45:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:45:27,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2025-03-04 06:45:27,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 253 transitions, 1256 flow. Second operand has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 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-04 06:45:27,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:27,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2025-03-04 06:45:27,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:27,823 INFO L124 PetriNetUnfolderBase]: 227/1128 cut-off events. [2025-03-04 06:45:27,823 INFO L125 PetriNetUnfolderBase]: For 970/999 co-relation queries the response was YES. [2025-03-04 06:45:27,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1128 events. 227/1128 cut-off events. For 970/999 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7325 event pairs, 39 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 2571. Up to 212 conditions per place. [2025-03-04 06:45:27,829 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 30 changer transitions 0/270 dead transitions. [2025-03-04 06:45:27,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 270 transitions, 1480 flow [2025-03-04 06:45:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:45:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:45:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3744 transitions. [2025-03-04 06:45:27,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910948905109489 [2025-03-04 06:45:27,836 INFO L175 Difference]: Start difference. First operand has 189 places, 253 transitions, 1256 flow. Second operand 30 states and 3744 transitions. [2025-03-04 06:45:27,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 270 transitions, 1480 flow [2025-03-04 06:45:27,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 270 transitions, 1472 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:27,848 INFO L231 Difference]: Finished difference. Result has 222 places, 263 transitions, 1400 flow [2025-03-04 06:45:27,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1400, PETRI_PLACES=222, PETRI_TRANSITIONS=263} [2025-03-04 06:45:27,849 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 83 predicate places. [2025-03-04 06:45:27,849 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 263 transitions, 1400 flow [2025-03-04 06:45:27,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 125.08695652173913) internal successors, (2877), 23 states have internal predecessors, (2877), 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-04 06:45:27,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:27,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:27,857 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-04 06:45:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:28,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-04 06:45:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1509340394, now seen corresponding path program 2 times [2025-03-04 06:45:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733070212] [2025-03-04 06:45:28,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:28,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 06:45:28,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 144 statements. [2025-03-04 06:45:28,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:28,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 06:45:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733070212] [2025-03-04 06:45:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733070212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:28,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994578636] [2025-03-04 06:45:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:28,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:28,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:28,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:28,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2025-03-04 06:45:28,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 263 transitions, 1400 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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-04 06:45:28,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:28,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2025-03-04 06:45:28,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:28,703 INFO L124 PetriNetUnfolderBase]: 571/1817 cut-off events. [2025-03-04 06:45:28,703 INFO L125 PetriNetUnfolderBase]: For 2404/2452 co-relation queries the response was YES. [2025-03-04 06:45:28,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 1817 events. 571/1817 cut-off events. For 2404/2452 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12256 event pairs, 127 based on Foata normal form. 25/1817 useless extension candidates. Maximal degree in co-relation 5256. Up to 841 conditions per place. [2025-03-04 06:45:28,713 INFO L140 encePairwiseOnDemand]: 120/137 looper letters, 120 selfloop transitions, 58 changer transitions 39/355 dead transitions. [2025-03-04 06:45:28,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 355 transitions, 2358 flow [2025-03-04 06:45:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2025-03-04 06:45:28,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953771289537713 [2025-03-04 06:45:28,715 INFO L175 Difference]: Start difference. First operand has 222 places, 263 transitions, 1400 flow. Second operand 6 states and 736 transitions. [2025-03-04 06:45:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 355 transitions, 2358 flow [2025-03-04 06:45:28,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 355 transitions, 2312 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:45:28,726 INFO L231 Difference]: Finished difference. Result has 213 places, 290 transitions, 1762 flow [2025-03-04 06:45:28,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1762, PETRI_PLACES=213, PETRI_TRANSITIONS=290} [2025-03-04 06:45:28,727 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 74 predicate places. [2025-03-04 06:45:28,727 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 290 transitions, 1762 flow [2025-03-04 06:45:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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-04 06:45:28,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:28,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:45:28,728 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-04 06:45:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1360863062, now seen corresponding path program 1 times [2025-03-04 06:45:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930785484] [2025-03-04 06:45:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 06:45:28,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 06:45:28,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:28,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:28,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:45:28,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 06:45:28,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 06:45:28,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:28,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:45:28,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:45:28,819 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:45:28,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-04 06:45:28,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-04 06:45:28,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:45:28,822 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-03-04 06:45:28,872 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:45:28,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:45:28,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:45:28 BasicIcfg [2025-03-04 06:45:28,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:45:28,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:45:28,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:45:28,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:45:28,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:22" (3/4) ... [2025-03-04 06:45:28,878 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 06:45:28,929 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-04 06:45:28,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:45:28,966 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:45:28,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:45:28,966 INFO L158 Benchmark]: Toolchain (without parser) took 7171.61ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 105.8MB in the beginning and 286.8MB in the end (delta: -181.1MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-04 06:45:28,967 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:28,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.63ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 83.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:45:28,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.57ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:28,969 INFO L158 Benchmark]: Boogie Preprocessor took 24.97ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:28,969 INFO L158 Benchmark]: IcfgBuilder took 419.45ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 60.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:45:28,970 INFO L158 Benchmark]: TraceAbstraction took 6260.64ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 59.6MB in the beginning and 295.2MB in the end (delta: -235.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:28,970 INFO L158 Benchmark]: Witness Printer took 88.77ms. Allocated memory is still 352.3MB. Free memory was 295.2MB in the beginning and 286.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:28,971 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.63ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 83.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.57ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.97ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 80.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 419.45ms. Allocated memory is still 142.6MB. Free memory was 80.2MB in the beginning and 60.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6260.64ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 59.6MB in the beginning and 295.2MB in the end (delta: -235.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.77ms. Allocated memory is still 352.3MB. Free memory was 295.2MB in the beginning and 286.8MB 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[10]; VAL [data={1:0}] [L680] 0 pthread_mutex_t m[10]; VAL [data={1:0}, m={2:0}] [L688] 0 int i = 0; VAL [data={1:0}, i=0, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=1, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=2, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=3, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=4, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=5, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=6, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=7, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=8, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=9, m={2:0}] [L688] COND TRUE 0 i < 10 VAL [data={1:0}, m={2:0}] [L688] 0 i++ VAL [data={1:0}, i=10, m={2:0}] [L688] COND FALSE 0 !(i < 10) VAL [data={1:0}, m={2:0}] [L690] 0 pthread_t id; VAL [data={1:0}, m={2:0}] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, data={1:0}, id=-1, m={2:0}] [L693] EXPR 0 data[4] VAL [\old(arg)={0:0}, data={1:0}, id=-1, m={2:0}] [L683] EXPR 1 data[4] VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] [L683] 1 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, m={2:0}] [L693] 0 data[4]++ VAL [\old(arg)={0:0}, arg={0:0}, data={1:0}, id=-1, m={2:0}] Now there is a data race (on the heap) between C: data[4]++ [683] and C: data[4]++ [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, 165 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: 6.1s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 18 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 631 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1762occurred in iteration=7, InterpolantAutomatonStates: 81, 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, 2.3s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1425 ConstructedInterpolants, 0 QuantifiedInterpolants, 2042 SizeOfPredicates, 22 NumberOfNonLiveVariables, 752 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 365/758 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-04 06:45:28,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)