./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_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 ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:39:54,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:39:54,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:39:54,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:39:54,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:39:54,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:39:54,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:39:54,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:39:54,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:39:54,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:39:54,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:39:54,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:39:54,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:39:54,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:39:54,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:39:54,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:39:54,299 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 -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2025-03-14 01:39:54,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:39:54,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:39:54,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:39:54,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:39:54,541 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:39:54,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-03-14 01:39:55,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d215a66/9e29f0ee91a74fd0bfb61bf958962c18/FLAG416d30c61 [2025-03-14 01:39:55,969 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:39:55,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-03-14 01:39:55,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d215a66/9e29f0ee91a74fd0bfb61bf958962c18/FLAG416d30c61 [2025-03-14 01:39:56,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d215a66/9e29f0ee91a74fd0bfb61bf958962c18 [2025-03-14 01:39:56,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:39:56,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:39:56,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:39:56,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:39:56,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:39:56,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56, skipping insertion in model container [2025-03-14 01:39:56,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:39:56,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:39:56,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:39:56,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:39:56,624 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:39:56,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56 WrapperNode [2025-03-14 01:39:56,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:39:56,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:39:56,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:39:56,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:39:56,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,669 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2025-03-14 01:39:56,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:39:56,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:39:56,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:39:56,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:39:56,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:39:56,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:39:56,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:39:56,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:39:56,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (1/1) ... [2025-03-14 01:39:56,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:39:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:39:56,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:39:56,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:39:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:39:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:39:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:39:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:39:56,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:39:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:39:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:39:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:39:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:39:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:39:56,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:39:56,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:39:56,765 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:39:56,877 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:39:56,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:39:57,054 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 01:39:57,055 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-14 01:39:57,137 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:39:57,137 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:39:57,137 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:39:57,184 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:39:57,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:39:57 BoogieIcfgContainer [2025-03-14 01:39:57,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:39:57,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:39:57,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:39:57,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:39:57,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:39:56" (1/3) ... [2025-03-14 01:39:57,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b91f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:39:57, skipping insertion in model container [2025-03-14 01:39:57,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:56" (2/3) ... [2025-03-14 01:39:57,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b91f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:39:57, skipping insertion in model container [2025-03-14 01:39:57,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:39:57" (3/3) ... [2025-03-14 01:39:57,193 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2025-03-14 01:39:57,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:39:57,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_27-funptr_racing.i that has 2 procedures, 193 locations, 1 initial locations, 7 loop locations, and 13 error locations. [2025-03-14 01:39:57,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:39:57,265 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:39:57,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 211 transitions, 429 flow [2025-03-14 01:39:57,376 INFO L124 PetriNetUnfolderBase]: 22/278 cut-off events. [2025-03-14 01:39:57,379 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:39:57,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 278 events. 22/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 994 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 172. Up to 4 conditions per place. [2025-03-14 01:39:57,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 211 transitions, 429 flow [2025-03-14 01:39:57,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 211 transitions, 429 flow [2025-03-14 01:39:57,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:39:57,409 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;@75856a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:39:57,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-14 01:39:57,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:39:57,418 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-14 01:39:57,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:39:57,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:57,419 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] [2025-03-14 01:39:57,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:39:57,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2145285005, now seen corresponding path program 1 times [2025-03-14 01:39:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-03-14 01:39:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:57,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-14 01:39:57,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-14 01:39:57,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:57,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:57,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-03-14 01:39:57,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753128118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:57,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:57,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:39:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902886044] [2025-03-14 01:39:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:57,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:57,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:57,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2025-03-14 01:39:57,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 211 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:57,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:57,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2025-03-14 01:39:57,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:57,948 INFO L124 PetriNetUnfolderBase]: 121/1108 cut-off events. [2025-03-14 01:39:57,948 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:39:57,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1108 events. 121/1108 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7557 event pairs, 0 based on Foata normal form. 106/1108 useless extension candidates. Maximal degree in co-relation 1292. Up to 254 conditions per place. [2025-03-14 01:39:57,955 INFO L140 encePairwiseOnDemand]: 192/211 looper letters, 36 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-03-14 01:39:57,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 205 transitions, 493 flow [2025-03-14 01:39:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2025-03-14 01:39:57,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9020537124802528 [2025-03-14 01:39:57,970 INFO L175 Difference]: Start difference. First operand has 196 places, 211 transitions, 429 flow. Second operand 3 states and 571 transitions. [2025-03-14 01:39:57,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 205 transitions, 493 flow [2025-03-14 01:39:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 205 transitions, 493 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:39:57,980 INFO L231 Difference]: Finished difference. Result has 197 places, 193 transitions, 401 flow [2025-03-14 01:39:57,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=197, PETRI_TRANSITIONS=193} [2025-03-14 01:39:57,985 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 1 predicate places. [2025-03-14 01:39:57,986 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 193 transitions, 401 flow [2025-03-14 01:39:57,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:57,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:57,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:57,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:39:57,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:39:57,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -56409895, now seen corresponding path program 1 times [2025-03-14 01:39:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:57,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-14 01:39:57,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:58,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:39:58,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:39:58,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:58,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320750015] [2025-03-14 01:39:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320750015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002303955] [2025-03-14 01:39:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:39:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:58,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:39:58,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:39:58,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 211 [2025-03-14 01:39:58,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 193 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:58,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:58,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 211 [2025-03-14 01:39:58,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:58,822 INFO L124 PetriNetUnfolderBase]: 241/1214 cut-off events. [2025-03-14 01:39:58,823 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:39:58,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 1214 events. 241/1214 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8974 event pairs, 24 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 1688. Up to 387 conditions per place. [2025-03-14 01:39:58,830 INFO L140 encePairwiseOnDemand]: 205/211 looper letters, 80 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-14 01:39:58,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 240 transitions, 665 flow [2025-03-14 01:39:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2025-03-14 01:39:58,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8072669826224329 [2025-03-14 01:39:58,837 INFO L175 Difference]: Start difference. First operand has 197 places, 193 transitions, 401 flow. Second operand 6 states and 1022 transitions. [2025-03-14 01:39:58,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 240 transitions, 665 flow [2025-03-14 01:39:58,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 240 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:58,842 INFO L231 Difference]: Finished difference. Result has 199 places, 192 transitions, 405 flow [2025-03-14 01:39:58,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=199, PETRI_TRANSITIONS=192} [2025-03-14 01:39:58,843 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 3 predicate places. [2025-03-14 01:39:58,843 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 192 transitions, 405 flow [2025-03-14 01:39:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:58,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:58,844 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] [2025-03-14 01:39:58,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:39:58,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:39:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash 948995907, now seen corresponding path program 1 times [2025-03-14 01:39:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-03-14 01:39:58,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:58,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:39:58,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:39:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364734245] [2025-03-14 01:39:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364734245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715165728] [2025-03-14 01:39:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:58,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:58,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:58,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:58,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 211 [2025-03-14 01:39:58,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 192 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:58,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:58,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 211 [2025-03-14 01:39:58,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:59,047 INFO L124 PetriNetUnfolderBase]: 169/1573 cut-off events. [2025-03-14 01:39:59,047 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:39:59,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1573 events. 169/1573 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12262 event pairs, 48 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 1891. Up to 189 conditions per place. [2025-03-14 01:39:59,054 INFO L140 encePairwiseOnDemand]: 207/211 looper letters, 41 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-03-14 01:39:59,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 212 transitions, 536 flow [2025-03-14 01:39:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-03-14 01:39:59,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8767772511848341 [2025-03-14 01:39:59,059 INFO L175 Difference]: Start difference. First operand has 199 places, 192 transitions, 405 flow. Second operand 3 states and 555 transitions. [2025-03-14 01:39:59,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 212 transitions, 536 flow [2025-03-14 01:39:59,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 212 transitions, 526 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:39:59,062 INFO L231 Difference]: Finished difference. Result has 198 places, 194 transitions, 417 flow [2025-03-14 01:39:59,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=198, PETRI_TRANSITIONS=194} [2025-03-14 01:39:59,064 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 2 predicate places. [2025-03-14 01:39:59,064 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 194 transitions, 417 flow [2025-03-14 01:39:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:59,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:59,064 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] [2025-03-14 01:39:59,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:39:59,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:39:59,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1969370027, now seen corresponding path program 1 times [2025-03-14 01:39:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-03-14 01:39:59,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:59,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:39:59,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:39:59,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:59,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345362099] [2025-03-14 01:39:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345362099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121674527] [2025-03-14 01:39:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:39:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:59,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:39:59,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:39:59,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 211 [2025-03-14 01:39:59,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 194 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:59,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:59,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 211 [2025-03-14 01:39:59,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:59,314 INFO L124 PetriNetUnfolderBase]: 38/426 cut-off events. [2025-03-14 01:39:59,314 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:39:59,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 426 events. 38/426 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1736 event pairs, 0 based on Foata normal form. 13/421 useless extension candidates. Maximal degree in co-relation 475. Up to 25 conditions per place. [2025-03-14 01:39:59,316 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 50 selfloop transitions, 4 changer transitions 0/173 dead transitions. [2025-03-14 01:39:59,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 173 transitions, 466 flow [2025-03-14 01:39:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1051 transitions. [2025-03-14 01:39:59,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.830173775671406 [2025-03-14 01:39:59,318 INFO L175 Difference]: Start difference. First operand has 198 places, 194 transitions, 417 flow. Second operand 6 states and 1051 transitions. [2025-03-14 01:39:59,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 173 transitions, 466 flow [2025-03-14 01:39:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 173 transitions, 459 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-14 01:39:59,321 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 287 flow [2025-03-14 01:39:59,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-03-14 01:39:59,322 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -51 predicate places. [2025-03-14 01:39:59,322 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 287 flow [2025-03-14 01:39:59,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:59,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:59,323 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] [2025-03-14 01:39:59,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:39:59,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:39:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash -427275706, now seen corresponding path program 1 times [2025-03-14 01:39:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375066888] [2025-03-14 01:39:59,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:59,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:39:59,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:39:59,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:59,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:59,341 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:39:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:39:59,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:39:59,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:59,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:59,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:39:59,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:39:59,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-14 01:39:59,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-14 01:39:59,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-14 01:39:59,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-14 01:39:59,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-14 01:39:59,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-14 01:39:59,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-14 01:39:59,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-14 01:39:59,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:39:59,379 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-14 01:39:59,380 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:39:59,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:39:59,420 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:39:59,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 315 transitions, 646 flow [2025-03-14 01:39:59,467 INFO L124 PetriNetUnfolderBase]: 41/476 cut-off events. [2025-03-14 01:39:59,468 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:39:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 476 events. 41/476 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2063 event pairs, 0 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 295. Up to 6 conditions per place. [2025-03-14 01:39:59,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 315 transitions, 646 flow [2025-03-14 01:39:59,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 315 transitions, 646 flow [2025-03-14 01:39:59,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:39:59,477 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;@75856a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:39:59,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-14 01:39:59,480 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:39:59,480 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-03-14 01:39:59,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:39:59,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:59,480 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] [2025-03-14 01:39:59,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:39:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1304967726, now seen corresponding path program 1 times [2025-03-14 01:39:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-03-14 01:39:59,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:59,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-14 01:39:59,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-14 01:39:59,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:59,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-03-14 01:39:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887102214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:39:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277669633] [2025-03-14 01:39:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:59,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:59,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 315 [2025-03-14 01:39:59,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 315 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:39:59,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:59,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 315 [2025-03-14 01:39:59,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:01,160 INFO L124 PetriNetUnfolderBase]: 3473/16841 cut-off events. [2025-03-14 01:40:01,161 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-14 01:40:01,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22392 conditions, 16841 events. 3473/16841 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 209725 event pairs, 3267 based on Foata normal form. 2315/17485 useless extension candidates. Maximal degree in co-relation 19183. Up to 5465 conditions per place. [2025-03-14 01:40:01,287 INFO L140 encePairwiseOnDemand]: 284/315 looper letters, 51 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-14 01:40:01,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 298 transitions, 718 flow [2025-03-14 01:40:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-03-14 01:40:01,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8804232804232804 [2025-03-14 01:40:01,289 INFO L175 Difference]: Start difference. First operand has 288 places, 315 transitions, 646 flow. Second operand 3 states and 832 transitions. [2025-03-14 01:40:01,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 298 transitions, 718 flow [2025-03-14 01:40:01,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 298 transitions, 718 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:01,298 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 598 flow [2025-03-14 01:40:01,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2025-03-14 01:40:01,299 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 1 predicate places. [2025-03-14 01:40:01,299 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 598 flow [2025-03-14 01:40:01,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:01,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:01,299 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] [2025-03-14 01:40:01,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:40:01,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:01,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -78277836, now seen corresponding path program 1 times [2025-03-14 01:40:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864407286] [2025-03-14 01:40:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:01,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:40:01,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:40:01,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:01,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:40:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864407286] [2025-03-14 01:40:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864407286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875116681] [2025-03-14 01:40:01,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:01,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:40:01,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:01,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:40:01,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:40:01,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 315 [2025-03-14 01:40:01,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 598 flow. Second operand has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:01,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:01,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 315 [2025-03-14 01:40:01,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:03,688 INFO L124 PetriNetUnfolderBase]: 6826/21961 cut-off events. [2025-03-14 01:40:03,688 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2025-03-14 01:40:03,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33089 conditions, 21961 events. 6826/21961 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 265329 event pairs, 626 based on Foata normal form. 0/20411 useless extension candidates. Maximal degree in co-relation 11702. Up to 7803 conditions per place. [2025-03-14 01:40:03,794 INFO L140 encePairwiseOnDemand]: 309/315 looper letters, 142 selfloop transitions, 6 changer transitions 0/381 dead transitions. [2025-03-14 01:40:03,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 381 transitions, 1084 flow [2025-03-14 01:40:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:40:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:40:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1552 transitions. [2025-03-14 01:40:03,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8211640211640212 [2025-03-14 01:40:03,798 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 598 flow. Second operand 6 states and 1552 transitions. [2025-03-14 01:40:03,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 381 transitions, 1084 flow [2025-03-14 01:40:03,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 381 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:03,805 INFO L231 Difference]: Finished difference. Result has 292 places, 285 transitions, 606 flow [2025-03-14 01:40:03,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=606, PETRI_PLACES=292, PETRI_TRANSITIONS=285} [2025-03-14 01:40:03,807 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 4 predicate places. [2025-03-14 01:40:03,809 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 285 transitions, 606 flow [2025-03-14 01:40:03,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:03,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:03,810 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] [2025-03-14 01:40:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:40:03,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 293657481, now seen corresponding path program 1 times [2025-03-14 01:40:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246096280] [2025-03-14 01:40:03,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:03,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:40:03,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:40:03,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:40:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246096280] [2025-03-14 01:40:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246096280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:03,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:40:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968382473] [2025-03-14 01:40:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:03,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:03,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:03,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 315 [2025-03-14 01:40:03,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 285 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:03,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:03,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 315 [2025-03-14 01:40:03,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:06,433 INFO L124 PetriNetUnfolderBase]: 6248/30719 cut-off events. [2025-03-14 01:40:06,434 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-03-14 01:40:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40676 conditions, 30719 events. 6248/30719 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 423519 event pairs, 2376 based on Foata normal form. 0/27360 useless extension candidates. Maximal degree in co-relation 31831. Up to 5556 conditions per place. [2025-03-14 01:40:06,593 INFO L140 encePairwiseOnDemand]: 308/315 looper letters, 74 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-14 01:40:06,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 323 transitions, 851 flow [2025-03-14 01:40:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-14 01:40:06,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2025-03-14 01:40:06,596 INFO L175 Difference]: Start difference. First operand has 292 places, 285 transitions, 606 flow. Second operand 3 states and 816 transitions. [2025-03-14 01:40:06,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 323 transitions, 851 flow [2025-03-14 01:40:06,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 323 transitions, 839 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:40:06,600 INFO L231 Difference]: Finished difference. Result has 291 places, 290 transitions, 638 flow [2025-03-14 01:40:06,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=291, PETRI_TRANSITIONS=290} [2025-03-14 01:40:06,601 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 3 predicate places. [2025-03-14 01:40:06,601 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 290 transitions, 638 flow [2025-03-14 01:40:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:06,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:06,601 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] [2025-03-14 01:40:06,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:40:06,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:06,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1830519392, now seen corresponding path program 1 times [2025-03-14 01:40:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-14 01:40:06,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:06,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:40:06,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:40:06,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:06,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:40:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638212283] [2025-03-14 01:40:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638212283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:06,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:06,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197163923] [2025-03-14 01:40:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:06,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:40:06,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:06,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:40:06,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:40:06,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 315 [2025-03-14 01:40:06,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 290 transitions, 638 flow. Second operand has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:06,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:06,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 315 [2025-03-14 01:40:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:09,489 INFO L124 PetriNetUnfolderBase]: 7042/34434 cut-off events. [2025-03-14 01:40:09,490 INFO L125 PetriNetUnfolderBase]: For 681/689 co-relation queries the response was YES. [2025-03-14 01:40:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47022 conditions, 34434 events. 7042/34434 cut-off events. For 681/689 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 486384 event pairs, 1793 based on Foata normal form. 13/31001 useless extension candidates. Maximal degree in co-relation 42703. Up to 10405 conditions per place. [2025-03-14 01:40:09,682 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 100 selfloop transitions, 5 changer transitions 0/352 dead transitions. [2025-03-14 01:40:09,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 352 transitions, 972 flow [2025-03-14 01:40:09,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:40:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:40:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-14 01:40:09,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8306878306878307 [2025-03-14 01:40:09,686 INFO L175 Difference]: Start difference. First operand has 291 places, 290 transitions, 638 flow. Second operand 6 states and 1570 transitions. [2025-03-14 01:40:09,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 352 transitions, 972 flow [2025-03-14 01:40:09,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 352 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:40:09,700 INFO L231 Difference]: Finished difference. Result has 297 places, 292 transitions, 654 flow [2025-03-14 01:40:09,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=297, PETRI_TRANSITIONS=292} [2025-03-14 01:40:09,703 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 9 predicate places. [2025-03-14 01:40:09,703 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 292 transitions, 654 flow [2025-03-14 01:40:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 245.8) internal successors, (1229), 5 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:09,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:09,704 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-14 01:40:09,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:40:09,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:09,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -424369800, now seen corresponding path program 1 times [2025-03-14 01:40:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-14 01:40:09,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:09,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:40:09,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:40:09,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:09,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:40:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-03-14 01:40:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:09,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:09,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:40:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43791886] [2025-03-14 01:40:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:09,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:09,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:09,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 315 [2025-03-14 01:40:09,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 292 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:09,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:09,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 315 [2025-03-14 01:40:09,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:20,588 INFO L124 PetriNetUnfolderBase]: 36162/135218 cut-off events. [2025-03-14 01:40:20,589 INFO L125 PetriNetUnfolderBase]: For 851/851 co-relation queries the response was YES. [2025-03-14 01:40:21,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193784 conditions, 135218 events. 36162/135218 cut-off events. For 851/851 co-relation queries the response was YES. Maximal size of possible extension queue 3387. Compared 2158658 event pairs, 14868 based on Foata normal form. 0/121491 useless extension candidates. Maximal degree in co-relation 193470. Up to 31067 conditions per place. [2025-03-14 01:40:21,516 INFO L140 encePairwiseOnDemand]: 280/315 looper letters, 102 selfloop transitions, 26 changer transitions 0/351 dead transitions. [2025-03-14 01:40:21,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 351 transitions, 1039 flow [2025-03-14 01:40:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-14 01:40:21,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8338624338624339 [2025-03-14 01:40:21,518 INFO L175 Difference]: Start difference. First operand has 297 places, 292 transitions, 654 flow. Second operand 3 states and 788 transitions. [2025-03-14 01:40:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 351 transitions, 1039 flow [2025-03-14 01:40:21,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 351 transitions, 1033 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:40:21,523 INFO L231 Difference]: Finished difference. Result has 299 places, 318 transitions, 874 flow [2025-03-14 01:40:21,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=299, PETRI_TRANSITIONS=318} [2025-03-14 01:40:21,524 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 11 predicate places. [2025-03-14 01:40:21,524 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 318 transitions, 874 flow [2025-03-14 01:40:21,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:21,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:21,525 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-14 01:40:21,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:40:21,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -508583830, now seen corresponding path program 1 times [2025-03-14 01:40:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769105766] [2025-03-14 01:40:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:21,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:40:21,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:40:21,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:21,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:40:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:21,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769105766] [2025-03-14 01:40:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769105766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:40:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537953905] [2025-03-14 01:40:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:21,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:21,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:21,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 315 [2025-03-14 01:40:21,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 318 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:21,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:21,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 315 [2025-03-14 01:40:21,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:33,713 INFO L124 PetriNetUnfolderBase]: 33872/146271 cut-off events. [2025-03-14 01:40:33,714 INFO L125 PetriNetUnfolderBase]: For 33809/35095 co-relation queries the response was YES. [2025-03-14 01:40:34,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233894 conditions, 146271 events. 33872/146271 cut-off events. For 33809/35095 co-relation queries the response was YES. Maximal size of possible extension queue 3577. Compared 2452652 event pairs, 23583 based on Foata normal form. 218/133489 useless extension candidates. Maximal degree in co-relation 233555. Up to 47317 conditions per place. [2025-03-14 01:40:34,587 INFO L140 encePairwiseOnDemand]: 302/315 looper letters, 92 selfloop transitions, 22 changer transitions 0/358 dead transitions. [2025-03-14 01:40:34,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 358 transitions, 1244 flow [2025-03-14 01:40:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2025-03-14 01:40:34,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8211640211640212 [2025-03-14 01:40:34,589 INFO L175 Difference]: Start difference. First operand has 299 places, 318 transitions, 874 flow. Second operand 3 states and 776 transitions. [2025-03-14 01:40:34,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 358 transitions, 1244 flow [2025-03-14 01:40:34,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 358 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:40:34,654 INFO L231 Difference]: Finished difference. Result has 301 places, 338 transitions, 1028 flow [2025-03-14 01:40:34,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=301, PETRI_TRANSITIONS=338} [2025-03-14 01:40:34,656 INFO L279 CegarLoopForPetriNet]: 288 programPoint places, 13 predicate places. [2025-03-14 01:40:34,656 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 338 transitions, 1028 flow [2025-03-14 01:40:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:34,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:34,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:40:34,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:40:34,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-14 01:40:34,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2052554126, now seen corresponding path program 1 times [2025-03-14 01:40:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869639059] [2025-03-14 01:40:34,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:34,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:40:34,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:40:34,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:34,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:40:34,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869639059] [2025-03-14 01:40:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869639059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:40:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44042355] [2025-03-14 01:40:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:34,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:34,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:34,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:34,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 315 [2025-03-14 01:40:34,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 338 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:34,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:34,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 315 [2025-03-14 01:40:34,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand