./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_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_11-ptr_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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:19:31,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:19:31,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:19:31,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:19:31,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:19:31,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:19:31,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:19:31,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:19:31,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:19:31,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:19:31,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:19:31,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:19:31,495 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:19:31,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:19:31,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:19:31,496 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:19:31,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:31,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:19:31,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:19:31,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:19:31,498 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-03-13 22:19:31,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:19:31,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:19:31,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:19:31,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:19:31,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:19:31,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-13 22:19:32,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d509f974c/8b9c39097d5e45ea93b686aa67761702/FLAGe7bafaa9a [2025-03-13 22:19:33,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:19:33,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-13 22:19:33,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d509f974c/8b9c39097d5e45ea93b686aa67761702/FLAGe7bafaa9a [2025-03-13 22:19:33,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d509f974c/8b9c39097d5e45ea93b686aa67761702 [2025-03-13 22:19:33,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:19:33,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:19:33,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:33,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:19:33,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:19:33,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@546143e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33, skipping insertion in model container [2025-03-13 22:19:33,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:19:33,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:33,701 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:19:33,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:19:33,825 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:19:33,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33 WrapperNode [2025-03-13 22:19:33,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:19:33,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:33,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:19:33,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:19:33,831 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:19:33" (1/1) ... [2025-03-13 22:19:33,847 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:19:33" (1/1) ... [2025-03-13 22:19:33,870 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-03-13 22:19:33,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:19:33,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:19:33,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:19:33,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:19:33,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:19:33,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:19:33,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:19:33,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:19:33,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (1/1) ... [2025-03-13 22:19:33,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:19:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:19:33,952 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:19:33,959 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:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:19:33,977 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:19:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:19:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:19:33,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:19:33,979 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:19:34,095 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:19:34,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:19:34,353 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:19:34,354 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-13 22:19:34,439 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:19:34,441 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:19:34,441 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:19:34,473 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:19:34,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:34 BoogieIcfgContainer [2025-03-13 22:19:34,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:19:34,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:19:34,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:19:34,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:19:34,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:19:33" (1/3) ... [2025-03-13 22:19:34,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0ce3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:34, skipping insertion in model container [2025-03-13 22:19:34,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:19:33" (2/3) ... [2025-03-13 22:19:34,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0ce3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:19:34, skipping insertion in model container [2025-03-13 22:19:34,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:19:34" (3/3) ... [2025-03-13 22:19:34,480 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-03-13 22:19:34,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:19:34,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 157 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-13 22:19:34,496 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:19:34,555 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:19:34,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 168 transitions, 343 flow [2025-03-13 22:19:34,657 INFO L124 PetriNetUnfolderBase]: 15/230 cut-off events. [2025-03-13 22:19:34,662 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:19:34,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 230 events. 15/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 128. Up to 4 conditions per place. [2025-03-13 22:19:34,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 168 transitions, 343 flow [2025-03-13 22:19:34,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 168 transitions, 343 flow [2025-03-13 22:19:34,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:34,709 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;@1ab516ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:34,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-13 22:19:34,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:34,721 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-03-13 22:19:34,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:34,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:34,727 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] [2025-03-13 22:19:34,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:34,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1713367683, now seen corresponding path program 1 times [2025-03-13 22:19:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448580738] [2025-03-13 22:19:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:34,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 22:19:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 22:19:34,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:34,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:35,526 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:19:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448580738] [2025-03-13 22:19:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448580738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:35,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108861900] [2025-03-13 22:19:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:35,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:35,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:35,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:35,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 168 [2025-03-13 22:19:35,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 168 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:19:35,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:35,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 168 [2025-03-13 22:19:35,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:36,204 INFO L124 PetriNetUnfolderBase]: 579/2149 cut-off events. [2025-03-13 22:19:36,205 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:19:36,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 2149 events. 579/2149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14897 event pairs, 343 based on Foata normal form. 150/2134 useless extension candidates. Maximal degree in co-relation 3258. Up to 1080 conditions per place. [2025-03-13 22:19:36,223 INFO L140 encePairwiseOnDemand]: 135/168 looper letters, 73 selfloop transitions, 70 changer transitions 0/249 dead transitions. [2025-03-13 22:19:36,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 249 transitions, 791 flow [2025-03-13 22:19:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2025-03-13 22:19:36,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8134920634920635 [2025-03-13 22:19:36,243 INFO L175 Difference]: Start difference. First operand has 160 places, 168 transitions, 343 flow. Second operand 6 states and 820 transitions. [2025-03-13 22:19:36,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 249 transitions, 791 flow [2025-03-13 22:19:36,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 249 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:36,255 INFO L231 Difference]: Finished difference. Result has 168 places, 225 transitions, 781 flow [2025-03-13 22:19:36,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=781, PETRI_PLACES=168, PETRI_TRANSITIONS=225} [2025-03-13 22:19:36,261 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 8 predicate places. [2025-03-13 22:19:36,261 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 225 transitions, 781 flow [2025-03-13 22:19:36,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:19:36,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:36,262 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] [2025-03-13 22:19:36,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:19:36,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:36,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1800327682, now seen corresponding path program 1 times [2025-03-13 22:19:36,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51108453] [2025-03-13 22:19:36,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:19:36,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:19:36,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:36,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:36,325 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:19:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51108453] [2025-03-13 22:19:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51108453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332081606] [2025-03-13 22:19:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:36,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:36,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:36,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:36,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 168 [2025-03-13 22:19:36,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 225 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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:19:36,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:36,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 168 [2025-03-13 22:19:36,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:36,490 INFO L124 PetriNetUnfolderBase]: 188/1062 cut-off events. [2025-03-13 22:19:36,491 INFO L125 PetriNetUnfolderBase]: For 119/133 co-relation queries the response was YES. [2025-03-13 22:19:36,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 1062 events. 188/1062 cut-off events. For 119/133 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6100 event pairs, 28 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 1640. Up to 191 conditions per place. [2025-03-13 22:19:36,498 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 22 selfloop transitions, 3 changer transitions 0/231 dead transitions. [2025-03-13 22:19:36,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 231 transitions, 843 flow [2025-03-13 22:19:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-03-13 22:19:36,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876984126984127 [2025-03-13 22:19:36,501 INFO L175 Difference]: Start difference. First operand has 168 places, 225 transitions, 781 flow. Second operand 3 states and 442 transitions. [2025-03-13 22:19:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 231 transitions, 843 flow [2025-03-13 22:19:36,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 231 transitions, 843 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:36,518 INFO L231 Difference]: Finished difference. Result has 171 places, 225 transitions, 792 flow [2025-03-13 22:19:36,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=171, PETRI_TRANSITIONS=225} [2025-03-13 22:19:36,519 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2025-03-13 22:19:36,519 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 225 transitions, 792 flow [2025-03-13 22:19:36,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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:19:36,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:36,519 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] [2025-03-13 22:19:36,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:19:36,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:36,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 315706661, now seen corresponding path program 1 times [2025-03-13 22:19:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:36,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012637507] [2025-03-13 22:19:36,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:36,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:19:36,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:19:36,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:36,840 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:19:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012637507] [2025-03-13 22:19:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012637507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:36,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785721933] [2025-03-13 22:19:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:36,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:36,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:36,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:37,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2025-03-13 22:19:37,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 225 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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:19:37,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:37,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2025-03-13 22:19:37,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:37,308 INFO L124 PetriNetUnfolderBase]: 370/1605 cut-off events. [2025-03-13 22:19:37,308 INFO L125 PetriNetUnfolderBase]: For 475/494 co-relation queries the response was YES. [2025-03-13 22:19:37,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3283 conditions, 1605 events. 370/1605 cut-off events. For 475/494 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11069 event pairs, 99 based on Foata normal form. 2/1545 useless extension candidates. Maximal degree in co-relation 3162. Up to 642 conditions per place. [2025-03-13 22:19:37,316 INFO L140 encePairwiseOnDemand]: 150/168 looper letters, 112 selfloop transitions, 53 changer transitions 0/284 dead transitions. [2025-03-13 22:19:37,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 284 transitions, 1364 flow [2025-03-13 22:19:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2025-03-13 22:19:37,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7847222222222222 [2025-03-13 22:19:37,318 INFO L175 Difference]: Start difference. First operand has 171 places, 225 transitions, 792 flow. Second operand 6 states and 791 transitions. [2025-03-13 22:19:37,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 284 transitions, 1364 flow [2025-03-13 22:19:37,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 284 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:19:37,328 INFO L231 Difference]: Finished difference. Result has 179 places, 268 transitions, 1274 flow [2025-03-13 22:19:37,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1274, PETRI_PLACES=179, PETRI_TRANSITIONS=268} [2025-03-13 22:19:37,329 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, 19 predicate places. [2025-03-13 22:19:37,329 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 268 transitions, 1274 flow [2025-03-13 22:19:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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:19:37,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:37,330 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] [2025-03-13 22:19:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:19:37,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-13 22:19:37,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 124974455, now seen corresponding path program 1 times [2025-03-13 22:19:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690491679] [2025-03-13 22:19:37,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:37,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:19:37,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:19:37,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:37,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:37,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:19:37,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:19:37,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:19:37,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:37,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:19:37,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:19:37,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:19:37,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-13 22:19:37,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-13 22:19:37,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-13 22:19:37,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:19:37,386 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 22:19:37,387 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:19:37,388 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:19:37,420 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:19:37,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 233 transitions, 482 flow [2025-03-13 22:19:37,454 INFO L124 PetriNetUnfolderBase]: 27/384 cut-off events. [2025-03-13 22:19:37,455 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:19:37,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 384 events. 27/384 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1469 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 232. Up to 6 conditions per place. [2025-03-13 22:19:37,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 233 transitions, 482 flow [2025-03-13 22:19:37,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 233 transitions, 482 flow [2025-03-13 22:19:37,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:19:37,462 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;@1ab516ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:19:37,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:19:37,466 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:19:37,466 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-03-13 22:19:37,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:19:37,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:37,467 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] [2025-03-13 22:19:37,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -42470589, now seen corresponding path program 1 times [2025-03-13 22:19:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31159211] [2025-03-13 22:19:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:37,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 22:19:37,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 22:19:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:37,682 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:19:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31159211] [2025-03-13 22:19:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31159211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479959591] [2025-03-13 22:19:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:37,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:37,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:37,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:37,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 233 [2025-03-13 22:19:37,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 233 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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:19:37,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:37,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 233 [2025-03-13 22:19:37,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:43,841 INFO L124 PetriNetUnfolderBase]: 29152/68324 cut-off events. [2025-03-13 22:19:43,841 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2025-03-13 22:19:43,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113862 conditions, 68324 events. 29152/68324 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 760646 event pairs, 20498 based on Foata normal form. 5641/69887 useless extension candidates. Maximal degree in co-relation 89757. Up to 40551 conditions per place. [2025-03-13 22:19:44,149 INFO L140 encePairwiseOnDemand]: 178/233 looper letters, 122 selfloop transitions, 134 changer transitions 0/397 dead transitions. [2025-03-13 22:19:44,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 397 transitions, 1327 flow [2025-03-13 22:19:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1173 transitions. [2025-03-13 22:19:44,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8390557939914163 [2025-03-13 22:19:44,153 INFO L175 Difference]: Start difference. First operand has 220 places, 233 transitions, 482 flow. Second operand 6 states and 1173 transitions. [2025-03-13 22:19:44,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 397 transitions, 1327 flow [2025-03-13 22:19:44,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 397 transitions, 1327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:44,163 INFO L231 Difference]: Finished difference. Result has 228 places, 348 transitions, 1324 flow [2025-03-13 22:19:44,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1324, PETRI_PLACES=228, PETRI_TRANSITIONS=348} [2025-03-13 22:19:44,165 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 8 predicate places. [2025-03-13 22:19:44,165 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 348 transitions, 1324 flow [2025-03-13 22:19:44,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 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:19:44,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:44,167 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] [2025-03-13 22:19:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:19:44,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1238752290, now seen corresponding path program 1 times [2025-03-13 22:19:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065130331] [2025-03-13 22:19:44,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:19:44,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:19:44,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:44,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:44,198 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:19:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:44,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065130331] [2025-03-13 22:19:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065130331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:19:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734115949] [2025-03-13 22:19:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:19:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:19:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:19:44,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 233 [2025-03-13 22:19:44,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 348 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:19:44,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:44,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 233 [2025-03-13 22:19:44,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:47,086 INFO L124 PetriNetUnfolderBase]: 8732/28717 cut-off events. [2025-03-13 22:19:47,087 INFO L125 PetriNetUnfolderBase]: For 4052/4155 co-relation queries the response was YES. [2025-03-13 22:19:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50455 conditions, 28717 events. 8732/28717 cut-off events. For 4052/4155 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 326769 event pairs, 3547 based on Foata normal form. 1/26596 useless extension candidates. Maximal degree in co-relation 40716. Up to 8629 conditions per place. [2025-03-13 22:19:47,392 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 32 selfloop transitions, 3 changer transitions 0/356 dead transitions. [2025-03-13 22:19:47,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 356 transitions, 1416 flow [2025-03-13 22:19:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:19:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:19:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2025-03-13 22:19:47,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8640915593705293 [2025-03-13 22:19:47,394 INFO L175 Difference]: Start difference. First operand has 228 places, 348 transitions, 1324 flow. Second operand 3 states and 604 transitions. [2025-03-13 22:19:47,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 356 transitions, 1416 flow [2025-03-13 22:19:47,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 356 transitions, 1416 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:47,442 INFO L231 Difference]: Finished difference. Result has 231 places, 350 transitions, 1349 flow [2025-03-13 22:19:47,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=231, PETRI_TRANSITIONS=350} [2025-03-13 22:19:47,445 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 11 predicate places. [2025-03-13 22:19:47,445 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 350 transitions, 1349 flow [2025-03-13 22:19:47,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:19:47,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:47,446 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] [2025-03-13 22:19:47,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:19:47,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1626077261, now seen corresponding path program 1 times [2025-03-13 22:19:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:47,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705185560] [2025-03-13 22:19:47,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:47,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:19:47,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:19:47,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:47,666 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:19:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705185560] [2025-03-13 22:19:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705185560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141746326] [2025-03-13 22:19:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:47,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:47,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:47,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 233 [2025-03-13 22:19:47,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 350 transitions, 1349 flow. Second operand has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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:19:47,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:47,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 233 [2025-03-13 22:19:47,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:52,698 INFO L124 PetriNetUnfolderBase]: 21522/54637 cut-off events. [2025-03-13 22:19:52,698 INFO L125 PetriNetUnfolderBase]: For 18869/19896 co-relation queries the response was YES. [2025-03-13 22:19:52,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119605 conditions, 54637 events. 21522/54637 cut-off events. For 18869/19896 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 624883 event pairs, 7614 based on Foata normal form. 34/51769 useless extension candidates. Maximal degree in co-relation 119433. Up to 25460 conditions per place. [2025-03-13 22:19:52,987 INFO L140 encePairwiseOnDemand]: 207/233 looper letters, 192 selfloop transitions, 141 changer transitions 0/529 dead transitions. [2025-03-13 22:19:52,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 529 transitions, 2817 flow [2025-03-13 22:19:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1129 transitions. [2025-03-13 22:19:52,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8075822603719599 [2025-03-13 22:19:52,991 INFO L175 Difference]: Start difference. First operand has 231 places, 350 transitions, 1349 flow. Second operand 6 states and 1129 transitions. [2025-03-13 22:19:52,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 529 transitions, 2817 flow [2025-03-13 22:19:53,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 529 transitions, 2814 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:19:53,134 INFO L231 Difference]: Finished difference. Result has 240 places, 481 transitions, 2730 flow [2025-03-13 22:19:53,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2730, PETRI_PLACES=240, PETRI_TRANSITIONS=481} [2025-03-13 22:19:53,135 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 20 predicate places. [2025-03-13 22:19:53,135 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 481 transitions, 2730 flow [2025-03-13 22:19:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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:19:53,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:53,136 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] [2025-03-13 22:19:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:19:53,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:53,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash 793021374, now seen corresponding path program 1 times [2025-03-13 22:19:53,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:53,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375569845] [2025-03-13 22:19:53,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 22:19:53,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 22:19:53,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:53,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:53,197 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:19:53,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375569845] [2025-03-13 22:19:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375569845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757733228] [2025-03-13 22:19:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:53,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:19:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:19:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:19:53,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 233 [2025-03-13 22:19:53,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 481 transitions, 2730 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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:19:53,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:53,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 233 [2025-03-13 22:19:53,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:19:57,482 INFO L124 PetriNetUnfolderBase]: 13274/41570 cut-off events. [2025-03-13 22:19:57,482 INFO L125 PetriNetUnfolderBase]: For 22700/23929 co-relation queries the response was YES. [2025-03-13 22:19:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92633 conditions, 41570 events. 13274/41570 cut-off events. For 22700/23929 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 486094 event pairs, 2606 based on Foata normal form. 35/38853 useless extension candidates. Maximal degree in co-relation 33794. Up to 12331 conditions per place. [2025-03-13 22:19:57,764 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 56 selfloop transitions, 7 changer transitions 0/513 dead transitions. [2025-03-13 22:19:57,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 513 transitions, 2920 flow [2025-03-13 22:19:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:19:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:19:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-03-13 22:19:57,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512160228898427 [2025-03-13 22:19:57,767 INFO L175 Difference]: Start difference. First operand has 240 places, 481 transitions, 2730 flow. Second operand 6 states and 1190 transitions. [2025-03-13 22:19:57,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 513 transitions, 2920 flow [2025-03-13 22:19:57,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 513 transitions, 2902 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:19:57,895 INFO L231 Difference]: Finished difference. Result has 248 places, 483 transitions, 2744 flow [2025-03-13 22:19:57,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2712, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2744, PETRI_PLACES=248, PETRI_TRANSITIONS=483} [2025-03-13 22:19:57,896 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 28 predicate places. [2025-03-13 22:19:57,896 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 483 transitions, 2744 flow [2025-03-13 22:19:57,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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:19:57,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:19:57,896 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:19:57,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:19:57,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:19:57,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:19:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 5319893, now seen corresponding path program 1 times [2025-03-13 22:19:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:19:57,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336804556] [2025-03-13 22:19:57,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:19:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:19:57,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:19:57,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:58,116 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:19:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:58,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336804556] [2025-03-13 22:19:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336804556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:19:58,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:19:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:19:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891253072] [2025-03-13 22:19:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:19:58,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:19:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:58,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:19:58,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:19:58,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 233 [2025-03-13 22:19:58,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 483 transitions, 2744 flow. Second operand has 6 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 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:19:58,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:58,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 233 [2025-03-13 22:19:58,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:20:09,612 INFO L124 PetriNetUnfolderBase]: 44845/102091 cut-off events. [2025-03-13 22:20:09,612 INFO L125 PetriNetUnfolderBase]: For 69721/74906 co-relation queries the response was YES. [2025-03-13 22:20:10,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259477 conditions, 102091 events. 44845/102091 cut-off events. For 69721/74906 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 1170609 event pairs, 22595 based on Foata normal form. 106/96591 useless extension candidates. Maximal degree in co-relation 230934. Up to 64117 conditions per place. [2025-03-13 22:20:10,382 INFO L140 encePairwiseOnDemand]: 198/233 looper letters, 372 selfloop transitions, 245 changer transitions 0/766 dead transitions. [2025-03-13 22:20:10,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 766 transitions, 5436 flow [2025-03-13 22:20:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:20:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:20:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1102 transitions. [2025-03-13 22:20:10,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7882689556509299 [2025-03-13 22:20:10,385 INFO L175 Difference]: Start difference. First operand has 248 places, 483 transitions, 2744 flow. Second operand 6 states and 1102 transitions. [2025-03-13 22:20:10,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 766 transitions, 5436 flow [2025-03-13 22:20:10,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 766 transitions, 5426 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 22:20:10,776 INFO L231 Difference]: Finished difference. Result has 256 places, 718 transitions, 5252 flow [2025-03-13 22:20:10,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5252, PETRI_PLACES=256, PETRI_TRANSITIONS=718} [2025-03-13 22:20:10,777 INFO L279 CegarLoopForPetriNet]: 220 programPoint places, 36 predicate places. [2025-03-13 22:20:10,778 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 718 transitions, 5252 flow [2025-03-13 22:20:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.16666666666666) internal successors, (883), 6 states have internal predecessors, (883), 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:10,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:20:10,779 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2025-03-13 22:20:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:20:10,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:20:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:20:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 780165786, now seen corresponding path program 1 times [2025-03-13 22:20:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:20:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718479123] [2025-03-13 22:20:10,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:20:10,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:20:10,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:20:10,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:20:10,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:20:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:20:11,358 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:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:20:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718479123] [2025-03-13 22:20:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718479123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:20:11,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:20:11,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:20:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369146742] [2025-03-13 22:20:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:20:11,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:20:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:20:11,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:20:11,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:20:11,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 233 [2025-03-13 22:20:11,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 718 transitions, 5252 flow. Second operand has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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:11,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:20:11,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 233 [2025-03-13 22:20:11,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand