./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/28-race_reach_37-indirect_racing.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 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:20:13,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:20:13,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:20:13,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:20:13,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:20:13,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:20:13,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:20:13,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:20:13,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:20:13,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:20:13,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:20:13,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:13,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:20:13,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:20:13,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:20:13,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:20:13,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:20:13,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:20:13,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:20:13,213 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 -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-03-13 22:20:13,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:20:13,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:20:13,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:20:13,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:20:13,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:20:13,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-13 22:20:14,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce50e73/0ff159eb256842af84a8b26d97b97970/FLAG3b5bf4765 [2025-03-13 22:20:14,850 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:20:14,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-13 22:20:14,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce50e73/0ff159eb256842af84a8b26d97b97970/FLAG3b5bf4765 [2025-03-13 22:20:14,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce50e73/0ff159eb256842af84a8b26d97b97970 [2025-03-13 22:20:14,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:20:14,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:20:14,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:14,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:20:14,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:20:14,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:14" (1/1) ... [2025-03-13 22:20:14,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dbff5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:14, skipping insertion in model container [2025-03-13 22:20:14,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:20:14" (1/1) ... [2025-03-13 22:20:14,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:20:15,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:15,109 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:20:15,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:20:15,174 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:20:15,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15 WrapperNode [2025-03-13 22:20:15,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:20:15,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:15,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:20:15,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:20:15,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,217 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2025-03-13 22:20:15,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:20:15,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:20:15,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:20:15,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:20:15,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:20:15,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:20:15,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:20:15,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:20:15,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (1/1) ... [2025-03-13 22:20:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:20:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:20:15,268 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-13 22:20:15,274 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-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:20:15,290 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:20:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:20:15,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:20:15,291 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:20:15,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:20:15,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:20:15,601 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:20:15,602 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:20:15,687 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:20:15,688 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:20:15,688 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:20:15,715 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:20:15,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:15 BoogieIcfgContainer [2025-03-13 22:20:15,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:20:15,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:20:15,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:20:15,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:20:15,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:20:14" (1/3) ... [2025-03-13 22:20:15,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285d14c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:15, skipping insertion in model container [2025-03-13 22:20:15,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:20:15" (2/3) ... [2025-03-13 22:20:15,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285d14c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:20:15, skipping insertion in model container [2025-03-13 22:20:15,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:20:15" (3/3) ... [2025-03-13 22:20:15,723 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-03-13 22:20:15,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:20:15,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 171 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-03-13 22:20:15,736 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:20:15,801 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:20:15,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 182 transitions, 371 flow [2025-03-13 22:20:15,904 INFO L124 PetriNetUnfolderBase]: 15/243 cut-off events. [2025-03-13 22:20:15,906 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:20:15,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 243 events. 15/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 761 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2025-03-13 22:20:15,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 182 transitions, 371 flow [2025-03-13 22:20:15,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 182 transitions, 371 flow [2025-03-13 22:20:15,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:15,942 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;@2d6fc0ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:15,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-13 22:20:15,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:15,948 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 22:20:15,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:15,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:15,949 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] [2025-03-13 22:20:15,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash -803807723, now seen corresponding path program 1 times [2025-03-13 22:20:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21526852] [2025-03-13 22:20:15,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:20:16,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:20:16,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:16,117 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-13 22:20:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21526852] [2025-03-13 22:20:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21526852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:16,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773642076] [2025-03-13 22:20:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:16,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:16,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:16,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-13 22:20:16,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 182 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-13 22:20:16,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:16,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-13 22:20:16,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:16,329 INFO L124 PetriNetUnfolderBase]: 25/492 cut-off events. [2025-03-13 22:20:16,330 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:20:16,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 492 events. 25/492 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1939 event pairs, 24 based on Foata normal form. 35/475 useless extension candidates. Maximal degree in co-relation 446. Up to 69 conditions per place. [2025-03-13 22:20:16,335 INFO L140 encePairwiseOnDemand]: 169/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-13 22:20:16,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 381 flow [2025-03-13 22:20:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-13 22:20:16,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8882783882783882 [2025-03-13 22:20:16,353 INFO L175 Difference]: Start difference. First operand has 174 places, 182 transitions, 371 flow. Second operand 3 states and 485 transitions. [2025-03-13 22:20:16,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 381 flow [2025-03-13 22:20:16,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 169 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:16,362 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 349 flow [2025-03-13 22:20:16,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2025-03-13 22:20:16,368 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -1 predicate places. [2025-03-13 22:20:16,368 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 349 flow [2025-03-13 22:20:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-13 22:20:16,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,369 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] [2025-03-13 22:20:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:20:16,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 634900896, now seen corresponding path program 1 times [2025-03-13 22:20:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77419573] [2025-03-13 22:20:16,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:20:16,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:20:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:16,433 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-13 22:20:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77419573] [2025-03-13 22:20:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77419573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578922912] [2025-03-13 22:20:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:16,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:16,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:16,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-13 22:20:16,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-13 22:20:16,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:16,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-13 22:20:16,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:16,513 INFO L124 PetriNetUnfolderBase]: 25/489 cut-off events. [2025-03-13 22:20:16,513 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:20:16,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 489 events. 25/489 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1927 event pairs, 24 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 525. Up to 66 conditions per place. [2025-03-13 22:20:16,515 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 14 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2025-03-13 22:20:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 167 transitions, 375 flow [2025-03-13 22:20:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-13 22:20:16,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8772893772893773 [2025-03-13 22:20:16,519 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 349 flow. Second operand 3 states and 479 transitions. [2025-03-13 22:20:16,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 167 transitions, 375 flow [2025-03-13 22:20:16,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:16,545 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 343 flow [2025-03-13 22:20:16,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2025-03-13 22:20:16,546 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-13 22:20:16,546 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 343 flow [2025-03-13 22:20:16,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-13 22:20:16,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,547 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] [2025-03-13 22:20:16,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:20:16,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -320159850, now seen corresponding path program 1 times [2025-03-13 22:20:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879798432] [2025-03-13 22:20:16,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:20:16,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:20:16,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:16,603 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-13 22:20:16,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:16,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879798432] [2025-03-13 22:20:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879798432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078792308] [2025-03-13 22:20:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:16,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:16,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:16,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-13 22:20:16,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-13 22:20:16,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:16,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-13 22:20:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:16,691 INFO L124 PetriNetUnfolderBase]: 25/427 cut-off events. [2025-03-13 22:20:16,691 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:20:16,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 427 events. 25/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1613 event pairs, 24 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 466. Up to 68 conditions per place. [2025-03-13 22:20:16,693 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-13 22:20:16,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 377 flow [2025-03-13 22:20:16,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-13 22:20:16,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.86996336996337 [2025-03-13 22:20:16,695 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 343 flow. Second operand 3 states and 475 transitions. [2025-03-13 22:20:16,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 377 flow [2025-03-13 22:20:16,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:16,701 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 344 flow [2025-03-13 22:20:16,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2025-03-13 22:20:16,702 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-13 22:20:16,702 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 344 flow [2025-03-13 22:20:16,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-13 22:20:16,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:16,702 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] [2025-03-13 22:20:16,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:20:16,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:16,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2099860431, now seen corresponding path program 1 times [2025-03-13 22:20:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744994204] [2025-03-13 22:20:16,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:16,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:20:16,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:20:16,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:16,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:17,155 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-13 22:20:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744994204] [2025-03-13 22:20:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744994204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:17,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263084679] [2025-03-13 22:20:17,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:17,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:17,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:17,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:17,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2025-03-13 22:20:17,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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-13 22:20:17,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:17,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2025-03-13 22:20:17,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:17,746 INFO L124 PetriNetUnfolderBase]: 535/2098 cut-off events. [2025-03-13 22:20:17,746 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:20:17,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 2098 events. 535/2098 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14506 event pairs, 288 based on Foata normal form. 0/1921 useless extension candidates. Maximal degree in co-relation 3230. Up to 988 conditions per place. [2025-03-13 22:20:17,754 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 71 selfloop transitions, 70 changer transitions 0/259 dead transitions. [2025-03-13 22:20:17,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 259 transitions, 812 flow [2025-03-13 22:20:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 880 transitions. [2025-03-13 22:20:17,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058608058608059 [2025-03-13 22:20:17,756 INFO L175 Difference]: Start difference. First operand has 171 places, 166 transitions, 344 flow. Second operand 6 states and 880 transitions. [2025-03-13 22:20:17,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 259 transitions, 812 flow [2025-03-13 22:20:17,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 259 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:17,763 INFO L231 Difference]: Finished difference. Result has 179 places, 235 transitions, 802 flow [2025-03-13 22:20:17,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=802, PETRI_PLACES=179, PETRI_TRANSITIONS=235} [2025-03-13 22:20:17,765 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 5 predicate places. [2025-03-13 22:20:17,765 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 235 transitions, 802 flow [2025-03-13 22:20:17,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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-13 22:20:17,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:17,766 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] [2025-03-13 22:20:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:20:17,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1945297632, now seen corresponding path program 1 times [2025-03-13 22:20:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757755511] [2025-03-13 22:20:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:17,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:20:17,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:20:17,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:17,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:17,822 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-13 22:20:17,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:17,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757755511] [2025-03-13 22:20:17,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757755511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:17,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001559099] [2025-03-13 22:20:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:17,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:17,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:17,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:17,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:17,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2025-03-13 22:20:17,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 235 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-13 22:20:17,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:17,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2025-03-13 22:20:17,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:17,954 INFO L124 PetriNetUnfolderBase]: 176/1081 cut-off events. [2025-03-13 22:20:17,954 INFO L125 PetriNetUnfolderBase]: For 104/107 co-relation queries the response was YES. [2025-03-13 22:20:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1081 events. 176/1081 cut-off events. For 104/107 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6152 event pairs, 20 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1716. Up to 191 conditions per place. [2025-03-13 22:20:17,959 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 20 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2025-03-13 22:20:17,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 241 transitions, 860 flow [2025-03-13 22:20:17,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-13 22:20:17,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937728937728938 [2025-03-13 22:20:17,961 INFO L175 Difference]: Start difference. First operand has 179 places, 235 transitions, 802 flow. Second operand 3 states and 488 transitions. [2025-03-13 22:20:17,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 241 transitions, 860 flow [2025-03-13 22:20:17,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 241 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:17,968 INFO L231 Difference]: Finished difference. Result has 182 places, 235 transitions, 813 flow [2025-03-13 22:20:17,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=182, PETRI_TRANSITIONS=235} [2025-03-13 22:20:17,970 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 8 predicate places. [2025-03-13 22:20:17,971 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 235 transitions, 813 flow [2025-03-13 22:20:17,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-13 22:20:17,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:17,971 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] [2025-03-13 22:20:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:20:17,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -217490476, now seen corresponding path program 1 times [2025-03-13 22:20:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:17,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573843086] [2025-03-13 22:20:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:17,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:20:17,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:20:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:18,020 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-13 22:20:18,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:18,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573843086] [2025-03-13 22:20:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573843086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382876236] [2025-03-13 22:20:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:18,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:18,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:18,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-13 22:20:18,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 235 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-13 22:20:18,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:18,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-13 22:20:18,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:18,115 INFO L124 PetriNetUnfolderBase]: 160/891 cut-off events. [2025-03-13 22:20:18,115 INFO L125 PetriNetUnfolderBase]: For 93/96 co-relation queries the response was YES. [2025-03-13 22:20:18,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 891 events. 160/891 cut-off events. For 93/96 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4874 event pairs, 4 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1520. Up to 221 conditions per place. [2025-03-13 22:20:18,118 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 1 changer transitions 0/235 dead transitions. [2025-03-13 22:20:18,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 235 transitions, 847 flow [2025-03-13 22:20:18,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-03-13 22:20:18,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-03-13 22:20:18,120 INFO L175 Difference]: Start difference. First operand has 182 places, 235 transitions, 813 flow. Second operand 3 states and 481 transitions. [2025-03-13 22:20:18,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 235 transitions, 847 flow [2025-03-13 22:20:18,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 235 transitions, 841 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:18,124 INFO L231 Difference]: Finished difference. Result has 180 places, 233 transitions, 805 flow [2025-03-13 22:20:18,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=180, PETRI_TRANSITIONS=233} [2025-03-13 22:20:18,125 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 6 predicate places. [2025-03-13 22:20:18,125 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 233 transitions, 805 flow [2025-03-13 22:20:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-13 22:20:18,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:18,126 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] [2025-03-13 22:20:18,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:20:18,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 470671034, now seen corresponding path program 1 times [2025-03-13 22:20:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881313143] [2025-03-13 22:20:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:18,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:20:18,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:20:18,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:18,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:18,434 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-13 22:20:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881313143] [2025-03-13 22:20:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881313143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819155440] [2025-03-13 22:20:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:18,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:18,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:18,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 182 [2025-03-13 22:20:18,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 233 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 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-13 22:20:18,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:18,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 182 [2025-03-13 22:20:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:18,849 INFO L124 PetriNetUnfolderBase]: 310/1323 cut-off events. [2025-03-13 22:20:18,849 INFO L125 PetriNetUnfolderBase]: For 435/447 co-relation queries the response was YES. [2025-03-13 22:20:18,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1323 events. 310/1323 cut-off events. For 435/447 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8367 event pairs, 57 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 2808. Up to 561 conditions per place. [2025-03-13 22:20:18,855 INFO L140 encePairwiseOnDemand]: 164/182 looper letters, 103 selfloop transitions, 53 changer transitions 0/284 dead transitions. [2025-03-13 22:20:18,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 284 transitions, 1343 flow [2025-03-13 22:20:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2025-03-13 22:20:18,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2025-03-13 22:20:18,857 INFO L175 Difference]: Start difference. First operand has 180 places, 233 transitions, 805 flow. Second operand 6 states and 872 transitions. [2025-03-13 22:20:18,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 284 transitions, 1343 flow [2025-03-13 22:20:18,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 284 transitions, 1342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:18,863 INFO L231 Difference]: Finished difference. Result has 189 places, 276 transitions, 1292 flow [2025-03-13 22:20:18,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=189, PETRI_TRANSITIONS=276} [2025-03-13 22:20:18,864 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 15 predicate places. [2025-03-13 22:20:18,864 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 276 transitions, 1292 flow [2025-03-13 22:20:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 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-13 22:20:18,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:18,865 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:20:18,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-13 22:20:18,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:18,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1587232155, now seen corresponding path program 1 times [2025-03-13 22:20:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:18,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214699678] [2025-03-13 22:20:18,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:18,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:20:18,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:20:18,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:18,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:18,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:20:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:20:18,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:20:18,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:18,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:20:18,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:20:18,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:20:18,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-13 22:20:18,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-13 22:20:18,920 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-13 22:20:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:20:18,921 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:20:18,923 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:20:18,923 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:20:18,953 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:20:18,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 252 transitions, 520 flow [2025-03-13 22:20:18,980 INFO L124 PetriNetUnfolderBase]: 27/401 cut-off events. [2025-03-13 22:20:18,980 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:20:18,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 401 events. 27/401 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1558 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 245. Up to 6 conditions per place. [2025-03-13 22:20:18,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 252 transitions, 520 flow [2025-03-13 22:20:18,985 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 252 transitions, 520 flow [2025-03-13 22:20:18,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:20:18,986 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;@2d6fc0ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:20:18,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-13 22:20:18,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:20:18,987 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 22:20:18,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:20:18,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:18,987 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] [2025-03-13 22:20:18,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:18,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1367804271, now seen corresponding path program 1 times [2025-03-13 22:20:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470431530] [2025-03-13 22:20:18,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:18,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 22:20:18,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 22:20:18,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:18,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:19,006 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-13 22:20:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470431530] [2025-03-13 22:20:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470431530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39748722] [2025-03-13 22:20:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:19,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:19,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:19,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:19,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2025-03-13 22:20:19,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 252 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-13 22:20:19,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:19,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2025-03-13 22:20:19,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:19,383 INFO L124 PetriNetUnfolderBase]: 430/3650 cut-off events. [2025-03-13 22:20:19,383 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-13 22:20:19,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 3650 events. 430/3650 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31541 event pairs, 420 based on Foata normal form. 380/3649 useless extension candidates. Maximal degree in co-relation 3675. Up to 739 conditions per place. [2025-03-13 22:20:19,401 INFO L140 encePairwiseOnDemand]: 233/252 looper letters, 24 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-03-13 22:20:19,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 233 transitions, 534 flow [2025-03-13 22:20:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-13 22:20:19,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822751322751323 [2025-03-13 22:20:19,403 INFO L175 Difference]: Start difference. First operand has 239 places, 252 transitions, 520 flow. Second operand 3 states and 667 transitions. [2025-03-13 22:20:19,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 233 transitions, 534 flow [2025-03-13 22:20:19,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:19,406 INFO L231 Difference]: Finished difference. Result has 238 places, 233 transitions, 486 flow [2025-03-13 22:20:19,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=238, PETRI_TRANSITIONS=233} [2025-03-13 22:20:19,408 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -1 predicate places. [2025-03-13 22:20:19,408 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 233 transitions, 486 flow [2025-03-13 22:20:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-13 22:20:19,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:19,409 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] [2025-03-13 22:20:19,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:20:19,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:19,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash -199894372, now seen corresponding path program 1 times [2025-03-13 22:20:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800888051] [2025-03-13 22:20:19,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:19,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:20:19,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:20:19,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:19,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:19,431 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-13 22:20:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800888051] [2025-03-13 22:20:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800888051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189835676] [2025-03-13 22:20:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:19,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:19,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 252 [2025-03-13 22:20:19,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 233 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-13 22:20:19,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:19,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 252 [2025-03-13 22:20:19,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:19,759 INFO L124 PetriNetUnfolderBase]: 418/3585 cut-off events. [2025-03-13 22:20:19,759 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 22:20:19,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 3585 events. 418/3585 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 30729 event pairs, 414 based on Foata normal form. 0/3226 useless extension candidates. Maximal degree in co-relation 4309. Up to 717 conditions per place. [2025-03-13 22:20:19,773 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 22 selfloop transitions, 1 changer transitions 0/231 dead transitions. [2025-03-13 22:20:19,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 231 transitions, 528 flow [2025-03-13 22:20:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-03-13 22:20:19,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664021164021164 [2025-03-13 22:20:19,775 INFO L175 Difference]: Start difference. First operand has 238 places, 233 transitions, 486 flow. Second operand 3 states and 655 transitions. [2025-03-13 22:20:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 231 transitions, 528 flow [2025-03-13 22:20:19,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:19,778 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 480 flow [2025-03-13 22:20:19,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2025-03-13 22:20:19,779 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-13 22:20:19,779 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 480 flow [2025-03-13 22:20:19,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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-13 22:20:19,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:19,779 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] [2025-03-13 22:20:19,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:20:19,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:19,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -348501614, now seen corresponding path program 1 times [2025-03-13 22:20:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154058666] [2025-03-13 22:20:19,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:19,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 22:20:19,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 22:20:19,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:19,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:19,800 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-13 22:20:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154058666] [2025-03-13 22:20:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154058666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:19,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:19,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512945310] [2025-03-13 22:20:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:19,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:19,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:19,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:19,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:19,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 252 [2025-03-13 22:20:19,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-13 22:20:19,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:19,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 252 [2025-03-13 22:20:19,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:20,187 INFO L124 PetriNetUnfolderBase]: 564/3754 cut-off events. [2025-03-13 22:20:20,188 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-13 22:20:20,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3754 events. 564/3754 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 33417 event pairs, 552 based on Foata normal form. 0/3363 useless extension candidates. Maximal degree in co-relation 4729. Up to 957 conditions per place. [2025-03-13 22:20:20,215 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 26 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-13 22:20:20,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 534 flow [2025-03-13 22:20:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-13 22:20:20,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558201058201058 [2025-03-13 22:20:20,217 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 480 flow. Second operand 3 states and 647 transitions. [2025-03-13 22:20:20,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 534 flow [2025-03-13 22:20:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 230 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:20,222 INFO L231 Difference]: Finished difference. Result has 236 places, 230 transitions, 481 flow [2025-03-13 22:20:20,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=236, PETRI_TRANSITIONS=230} [2025-03-13 22:20:20,223 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-13 22:20:20,223 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 230 transitions, 481 flow [2025-03-13 22:20:20,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-13 22:20:20,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:20,224 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] [2025-03-13 22:20:20,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:20:20,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:20,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1784187309, now seen corresponding path program 1 times [2025-03-13 22:20:20,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:20,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522268379] [2025-03-13 22:20:20,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:20:20,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:20:20,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:20,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:20,464 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-13 22:20:20,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:20,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522268379] [2025-03-13 22:20:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522268379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865501740] [2025-03-13 22:20:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:20,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:20,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:20,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:20,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:20,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 252 [2025-03-13 22:20:20,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 230 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-13 22:20:20,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:20,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 252 [2025-03-13 22:20:20,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:26,086 INFO L124 PetriNetUnfolderBase]: 27081/64015 cut-off events. [2025-03-13 22:20:26,087 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-13 22:20:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106377 conditions, 64015 events. 27081/64015 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 708055 event pairs, 16728 based on Foata normal form. 0/59605 useless extension candidates. Maximal degree in co-relation 106338. Up to 37371 conditions per place. [2025-03-13 22:20:26,592 INFO L140 encePairwiseOnDemand]: 213/252 looper letters, 120 selfloop transitions, 134 changer transitions 0/412 dead transitions. [2025-03-13 22:20:26,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 412 transitions, 1358 flow [2025-03-13 22:20:26,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2025-03-13 22:20:26,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2025-03-13 22:20:26,595 INFO L175 Difference]: Start difference. First operand has 236 places, 230 transitions, 481 flow. Second operand 6 states and 1233 transitions. [2025-03-13 22:20:26,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 412 transitions, 1358 flow [2025-03-13 22:20:26,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 412 transitions, 1354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:26,612 INFO L231 Difference]: Finished difference. Result has 244 places, 363 transitions, 1355 flow [2025-03-13 22:20:26,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=244, PETRI_TRANSITIONS=363} [2025-03-13 22:20:26,614 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 5 predicate places. [2025-03-13 22:20:26,615 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 363 transitions, 1355 flow [2025-03-13 22:20:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 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-13 22:20:26,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:26,616 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] [2025-03-13 22:20:26,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:20:26,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:26,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1701991652, now seen corresponding path program 1 times [2025-03-13 22:20:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:26,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94313317] [2025-03-13 22:20:26,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:26,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:26,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:20:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:20:26,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:26,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:26,651 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-13 22:20:26,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:26,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94313317] [2025-03-13 22:20:26,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94313317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:26,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:26,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:20:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116411513] [2025-03-13 22:20:26,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:26,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:26,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:26,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:26,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:26,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 252 [2025-03-13 22:20:26,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 363 transitions, 1355 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-13 22:20:26,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:26,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 252 [2025-03-13 22:20:26,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:29,006 INFO L124 PetriNetUnfolderBase]: 9347/29402 cut-off events. [2025-03-13 22:20:29,006 INFO L125 PetriNetUnfolderBase]: For 4659/5158 co-relation queries the response was YES. [2025-03-13 22:20:29,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53084 conditions, 29402 events. 9347/29402 cut-off events. For 4659/5158 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 329758 event pairs, 4307 based on Foata normal form. 1/27203 useless extension candidates. Maximal degree in co-relation 53041. Up to 11206 conditions per place. [2025-03-13 22:20:29,192 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 30 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2025-03-13 22:20:29,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 371 transitions, 1443 flow [2025-03-13 22:20:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-13 22:20:29,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-13 22:20:29,194 INFO L175 Difference]: Start difference. First operand has 244 places, 363 transitions, 1355 flow. Second operand 3 states and 665 transitions. [2025-03-13 22:20:29,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 371 transitions, 1443 flow [2025-03-13 22:20:29,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 371 transitions, 1443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:29,255 INFO L231 Difference]: Finished difference. Result has 247 places, 365 transitions, 1380 flow [2025-03-13 22:20:29,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=247, PETRI_TRANSITIONS=365} [2025-03-13 22:20:29,257 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2025-03-13 22:20:29,257 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 365 transitions, 1380 flow [2025-03-13 22:20:29,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-13 22:20:29,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:29,257 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] [2025-03-13 22:20:29,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:20:29,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:29,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1459168908, now seen corresponding path program 1 times [2025-03-13 22:20:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693098497] [2025-03-13 22:20:29,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:29,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:20:29,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:20:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:29,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:29,289 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-13 22:20:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693098497] [2025-03-13 22:20:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693098497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:20:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355054328] [2025-03-13 22:20:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:29,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:20:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:29,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:20:29,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:20:29,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 252 [2025-03-13 22:20:29,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 365 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-13 22:20:29,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:29,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 252 [2025-03-13 22:20:29,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:31,810 INFO L124 PetriNetUnfolderBase]: 9497/30318 cut-off events. [2025-03-13 22:20:31,811 INFO L125 PetriNetUnfolderBase]: For 4586/4722 co-relation queries the response was YES. [2025-03-13 22:20:31,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56222 conditions, 30318 events. 9497/30318 cut-off events. For 4586/4722 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 341063 event pairs, 3088 based on Foata normal form. 0/28718 useless extension candidates. Maximal degree in co-relation 56178. Up to 10835 conditions per place. [2025-03-13 22:20:31,996 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 34 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-13 22:20:31,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 370 transitions, 1467 flow [2025-03-13 22:20:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:20:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:20:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-13 22:20:31,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624338624338624 [2025-03-13 22:20:31,998 INFO L175 Difference]: Start difference. First operand has 247 places, 365 transitions, 1380 flow. Second operand 3 states and 652 transitions. [2025-03-13 22:20:31,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 370 transitions, 1467 flow [2025-03-13 22:20:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 370 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:20:32,110 INFO L231 Difference]: Finished difference. Result has 245 places, 363 transitions, 1383 flow [2025-03-13 22:20:32,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=245, PETRI_TRANSITIONS=363} [2025-03-13 22:20:32,111 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 6 predicate places. [2025-03-13 22:20:32,111 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 363 transitions, 1383 flow [2025-03-13 22:20:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-13 22:20:32,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:32,112 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] [2025-03-13 22:20:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:20:32,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -44859918, now seen corresponding path program 1 times [2025-03-13 22:20:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383577936] [2025-03-13 22:20:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:32,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:20:32,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:20:32,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:32,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:32,374 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-13 22:20:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:32,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383577936] [2025-03-13 22:20:32,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383577936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:32,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:32,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054139473] [2025-03-13 22:20:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:32,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:32,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:32,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 252 [2025-03-13 22:20:32,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 363 transitions, 1383 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-13 22:20:32,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:32,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 252 [2025-03-13 22:20:32,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:40,012 INFO L124 PetriNetUnfolderBase]: 33082/76913 cut-off events. [2025-03-13 22:20:40,013 INFO L125 PetriNetUnfolderBase]: For 31600/34605 co-relation queries the response was YES. [2025-03-13 22:20:40,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178760 conditions, 76913 events. 33082/76913 cut-off events. For 31600/34605 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 877012 event pairs, 7419 based on Foata normal form. 47/73725 useless extension candidates. Maximal degree in co-relation 178715. Up to 32092 conditions per place. [2025-03-13 22:20:40,513 INFO L140 encePairwiseOnDemand]: 204/252 looper letters, 463 selfloop transitions, 219 changer transitions 0/846 dead transitions. [2025-03-13 22:20:40,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 846 transitions, 4961 flow [2025-03-13 22:20:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1330 transitions. [2025-03-13 22:20:40,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-13 22:20:40,516 INFO L175 Difference]: Start difference. First operand has 245 places, 363 transitions, 1383 flow. Second operand 6 states and 1330 transitions. [2025-03-13 22:20:40,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 846 transitions, 4961 flow [2025-03-13 22:20:40,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 846 transitions, 4961 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:40,773 INFO L231 Difference]: Finished difference. Result has 255 places, 594 transitions, 3699 flow [2025-03-13 22:20:40,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3699, PETRI_PLACES=255, PETRI_TRANSITIONS=594} [2025-03-13 22:20:40,774 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2025-03-13 22:20:40,774 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 594 transitions, 3699 flow [2025-03-13 22:20:40,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 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-13 22:20:40,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:40,775 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] [2025-03-13 22:20:40,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:20:40,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:40,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1782653036, now seen corresponding path program 1 times [2025-03-13 22:20:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558646903] [2025-03-13 22:20:40,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:40,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:20:40,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:20:40,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:40,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:40,824 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-13 22:20:40,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:40,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558646903] [2025-03-13 22:20:40,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558646903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:40,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:40,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:40,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700970189] [2025-03-13 22:20:40,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:40,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:20:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:40,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:20:40,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:20:40,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 252 [2025-03-13 22:20:40,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 594 transitions, 3699 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 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-13 22:20:40,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:40,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 252 [2025-03-13 22:20:40,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:48,341 INFO L124 PetriNetUnfolderBase]: 22178/66253 cut-off events. [2025-03-13 22:20:48,342 INFO L125 PetriNetUnfolderBase]: For 49452/53230 co-relation queries the response was YES. [2025-03-13 22:20:48,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160392 conditions, 66253 events. 22178/66253 cut-off events. For 49452/53230 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 814252 event pairs, 2877 based on Foata normal form. 325/62941 useless extension candidates. Maximal degree in co-relation 160342. Up to 18287 conditions per place. [2025-03-13 22:20:48,811 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 54 selfloop transitions, 7 changer transitions 0/626 dead transitions. [2025-03-13 22:20:48,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 626 transitions, 3885 flow [2025-03-13 22:20:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1314 transitions. [2025-03-13 22:20:48,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2025-03-13 22:20:48,814 INFO L175 Difference]: Start difference. First operand has 255 places, 594 transitions, 3699 flow. Second operand 6 states and 1314 transitions. [2025-03-13 22:20:48,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 626 transitions, 3885 flow [2025-03-13 22:20:49,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 626 transitions, 3867 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:20:49,445 INFO L231 Difference]: Finished difference. Result has 263 places, 596 transitions, 3713 flow [2025-03-13 22:20:49,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3681, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3713, PETRI_PLACES=263, PETRI_TRANSITIONS=596} [2025-03-13 22:20:49,446 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places. [2025-03-13 22:20:49,446 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 596 transitions, 3713 flow [2025-03-13 22:20:49,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 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-13 22:20:49,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:49,447 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] [2025-03-13 22:20:49,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:20:49,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-13 22:20:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1554312326, now seen corresponding path program 1 times [2025-03-13 22:20:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:49,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328371066] [2025-03-13 22:20:49,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:49,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:20:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:20:49,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:49,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:49,796 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-13 22:20:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328371066] [2025-03-13 22:20:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328371066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:49,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:49,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:20:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261586526] [2025-03-13 22:20:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:49,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:20:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:49,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:20:49,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:20:49,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 252 [2025-03-13 22:20:49,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 596 transitions, 3713 flow. Second operand has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 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-13 22:20:49,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:49,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 252 [2025-03-13 22:20:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand