./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:49:56,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:49:56,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:49:56,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:49:56,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:49:56,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:49:56,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:49:56,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:49:56,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:49:56,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:49:56,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:49:56,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:49:56,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:56,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:49:56,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:49:56,826 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2025-03-04 06:49:57,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:49:57,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:49:57,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:49:57,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:49:57,080 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:49:57,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-04 06:49:58,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0116286a8/65f78dc621b24684ac20d2dab738edf7/FLAGb466f235b [2025-03-04 06:49:58,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:49:58,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2025-03-04 06:49:58,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0116286a8/65f78dc621b24684ac20d2dab738edf7/FLAGb466f235b [2025-03-04 06:49:58,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0116286a8/65f78dc621b24684ac20d2dab738edf7 [2025-03-04 06:49:58,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:49:58,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:49:58,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:58,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:49:58,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:49:58,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:58" (1/1) ... [2025-03-04 06:49:58,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760f7d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:58, skipping insertion in model container [2025-03-04 06:49:58,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:58" (1/1) ... [2025-03-04 06:49:58,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:49:59,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:59,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:49:59,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:59,174 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:49:59,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59 WrapperNode [2025-03-04 06:49:59,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:59,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:59,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:49:59,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:49:59,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,205 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2025-03-04 06:49:59,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:59,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:49:59,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:49:59,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:49:59,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:49:59,227 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:49:59,227 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:49:59,227 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:49:59,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (1/1) ... [2025-03-04 06:49:59,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:59,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:49:59,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:49:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:49:59,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:49:59,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:49:59,272 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:49:59,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:49:59,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:49:59,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:49:59,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:49:59,658 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:49:59,658 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:49:59,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:49:59,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:49:59,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:59 BoogieIcfgContainer [2025-03-04 06:49:59,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:49:59,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:49:59,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:49:59,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:49:59,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:49:58" (1/3) ... [2025-03-04 06:49:59,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670bef49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:59, skipping insertion in model container [2025-03-04 06:49:59,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:59" (2/3) ... [2025-03-04 06:49:59,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670bef49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:59, skipping insertion in model container [2025-03-04 06:49:59,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:59" (3/3) ... [2025-03-04 06:49:59,691 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2025-03-04 06:49:59,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:49:59,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_37-indirect_racing.i that has 2 procedures, 171 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-03-04 06:49:59,703 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:49:59,775 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:49:59,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 182 transitions, 371 flow [2025-03-04 06:49:59,887 INFO L124 PetriNetUnfolderBase]: 15/243 cut-off events. [2025-03-04 06:49:59,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:59,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 243 events. 15/243 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 761 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2025-03-04 06:49:59,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 182 transitions, 371 flow [2025-03-04 06:49:59,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 182 transitions, 371 flow [2025-03-04 06:49:59,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:59,924 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;@60722df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:59,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-04 06:49:59,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:59,953 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:49:59,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:59,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:59,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:59,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:49:59,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -803807723, now seen corresponding path program 1 times [2025-03-04 06:49:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797539514] [2025-03-04 06:49:59,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:50:00,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:50:00,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797539514] [2025-03-04 06:50:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797539514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630498038] [2025-03-04 06:50:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:00,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:00,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:00,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-04 06:50:00,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 182 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:00,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-04 06:50:00,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:00,307 INFO L124 PetriNetUnfolderBase]: 25/492 cut-off events. [2025-03-04 06:50:00,307 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:50:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 492 events. 25/492 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1939 event pairs, 24 based on Foata normal form. 35/475 useless extension candidates. Maximal degree in co-relation 446. Up to 69 conditions per place. [2025-03-04 06:50:00,313 INFO L140 encePairwiseOnDemand]: 169/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-03-04 06:50:00,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 381 flow [2025-03-04 06:50:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-04 06:50:00,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8882783882783882 [2025-03-04 06:50:00,327 INFO L175 Difference]: Start difference. First operand has 174 places, 182 transitions, 371 flow. Second operand 3 states and 485 transitions. [2025-03-04 06:50:00,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 381 flow [2025-03-04 06:50:00,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 169 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:00,335 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 349 flow [2025-03-04 06:50:00,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2025-03-04 06:50:00,340 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -1 predicate places. [2025-03-04 06:50:00,341 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 349 flow [2025-03-04 06:50:00,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:00,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:00,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:00,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash 634900896, now seen corresponding path program 1 times [2025-03-04 06:50:00,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:00,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37036605] [2025-03-04 06:50:00,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:00,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:50:00,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:50:00,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37036605] [2025-03-04 06:50:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37036605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704574694] [2025-03-04 06:50:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:00,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:00,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:00,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:00,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-04 06:50:00,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:00,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-04 06:50:00,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:00,490 INFO L124 PetriNetUnfolderBase]: 25/489 cut-off events. [2025-03-04 06:50:00,490 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:00,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 489 events. 25/489 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1927 event pairs, 24 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 525. Up to 66 conditions per place. [2025-03-04 06:50:00,495 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 14 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2025-03-04 06:50:00,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 167 transitions, 375 flow [2025-03-04 06:50:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-04 06:50:00,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8772893772893773 [2025-03-04 06:50:00,498 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 349 flow. Second operand 3 states and 479 transitions. [2025-03-04 06:50:00,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 167 transitions, 375 flow [2025-03-04 06:50:00,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:00,507 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 343 flow [2025-03-04 06:50:00,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2025-03-04 06:50:00,508 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-04 06:50:00,508 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 343 flow [2025-03-04 06:50:00,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:00,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:00,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:50:00,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:00,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -320159850, now seen corresponding path program 1 times [2025-03-04 06:50:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:00,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968014903] [2025-03-04 06:50:00,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:50:00,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:50:00,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:00,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968014903] [2025-03-04 06:50:00,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968014903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:00,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:00,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224029740] [2025-03-04 06:50:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:00,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:00,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:00,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:00,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2025-03-04 06:50:00,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:00,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2025-03-04 06:50:00,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:00,702 INFO L124 PetriNetUnfolderBase]: 25/427 cut-off events. [2025-03-04 06:50:00,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:50:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 427 events. 25/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1613 event pairs, 24 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 466. Up to 68 conditions per place. [2025-03-04 06:50:00,704 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:50:00,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 377 flow [2025-03-04 06:50:00,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2025-03-04 06:50:00,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.86996336996337 [2025-03-04 06:50:00,707 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 343 flow. Second operand 3 states and 475 transitions. [2025-03-04 06:50:00,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 377 flow [2025-03-04 06:50:00,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:00,710 INFO L231 Difference]: Finished difference. Result has 171 places, 166 transitions, 344 flow [2025-03-04 06:50:00,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=171, PETRI_TRANSITIONS=166} [2025-03-04 06:50:00,712 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, -3 predicate places. [2025-03-04 06:50:00,712 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 166 transitions, 344 flow [2025-03-04 06:50:00,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:00,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:00,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:00,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:00,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:00,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:00,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2099860431, now seen corresponding path program 1 times [2025-03-04 06:50:00,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:00,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670561859] [2025-03-04 06:50:00,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:00,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:50:00,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:50:00,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:00,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:01,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670561859] [2025-03-04 06:50:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670561859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015584840] [2025-03-04 06:50:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:01,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:01,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:01,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:01,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:01,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2025-03-04 06:50:01,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 166 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:01,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:01,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2025-03-04 06:50:01,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:01,781 INFO L124 PetriNetUnfolderBase]: 535/2098 cut-off events. [2025-03-04 06:50:01,781 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:50:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 2098 events. 535/2098 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14506 event pairs, 288 based on Foata normal form. 0/1921 useless extension candidates. Maximal degree in co-relation 3230. Up to 988 conditions per place. [2025-03-04 06:50:01,788 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 71 selfloop transitions, 70 changer transitions 0/259 dead transitions. [2025-03-04 06:50:01,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 259 transitions, 812 flow [2025-03-04 06:50:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 880 transitions. [2025-03-04 06:50:01,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8058608058608059 [2025-03-04 06:50:01,790 INFO L175 Difference]: Start difference. First operand has 171 places, 166 transitions, 344 flow. Second operand 6 states and 880 transitions. [2025-03-04 06:50:01,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 259 transitions, 812 flow [2025-03-04 06:50:01,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 259 transitions, 808 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:01,797 INFO L231 Difference]: Finished difference. Result has 179 places, 235 transitions, 802 flow [2025-03-04 06:50:01,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=802, PETRI_PLACES=179, PETRI_TRANSITIONS=235} [2025-03-04 06:50:01,798 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 5 predicate places. [2025-03-04 06:50:01,798 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 235 transitions, 802 flow [2025-03-04 06:50:01,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:01,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:01,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:01,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1945297632, now seen corresponding path program 1 times [2025-03-04 06:50:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871011455] [2025-03-04 06:50:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:01,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:50:01,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:50:01,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:01,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871011455] [2025-03-04 06:50:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871011455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:01,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:01,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:01,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774784964] [2025-03-04 06:50:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:01,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:01,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:01,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2025-03-04 06:50:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 235 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:01,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2025-03-04 06:50:01,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:01,997 INFO L124 PetriNetUnfolderBase]: 176/1081 cut-off events. [2025-03-04 06:50:01,997 INFO L125 PetriNetUnfolderBase]: For 104/107 co-relation queries the response was YES. [2025-03-04 06:50:01,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 1081 events. 176/1081 cut-off events. For 104/107 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6152 event pairs, 20 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1716. Up to 191 conditions per place. [2025-03-04 06:50:02,002 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 20 selfloop transitions, 3 changer transitions 0/241 dead transitions. [2025-03-04 06:50:02,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 241 transitions, 860 flow [2025-03-04 06:50:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-04 06:50:02,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937728937728938 [2025-03-04 06:50:02,006 INFO L175 Difference]: Start difference. First operand has 179 places, 235 transitions, 802 flow. Second operand 3 states and 488 transitions. [2025-03-04 06:50:02,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 241 transitions, 860 flow [2025-03-04 06:50:02,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 241 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:02,013 INFO L231 Difference]: Finished difference. Result has 182 places, 235 transitions, 813 flow [2025-03-04 06:50:02,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=182, PETRI_TRANSITIONS=235} [2025-03-04 06:50:02,014 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 8 predicate places. [2025-03-04 06:50:02,014 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 235 transitions, 813 flow [2025-03-04 06:50:02,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:02,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:02,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:02,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:50:02,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -217490476, now seen corresponding path program 1 times [2025-03-04 06:50:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266910284] [2025-03-04 06:50:02,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:02,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:50:02,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:50:02,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:02,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266910284] [2025-03-04 06:50:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266910284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337988140] [2025-03-04 06:50:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:02,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:02,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:02,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:02,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2025-03-04 06:50:02,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 235 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:02,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:02,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2025-03-04 06:50:02,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:02,162 INFO L124 PetriNetUnfolderBase]: 160/891 cut-off events. [2025-03-04 06:50:02,162 INFO L125 PetriNetUnfolderBase]: For 93/96 co-relation queries the response was YES. [2025-03-04 06:50:02,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 891 events. 160/891 cut-off events. For 93/96 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4874 event pairs, 4 based on Foata normal form. 0/843 useless extension candidates. Maximal degree in co-relation 1520. Up to 221 conditions per place. [2025-03-04 06:50:02,166 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 1 changer transitions 0/235 dead transitions. [2025-03-04 06:50:02,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 235 transitions, 847 flow [2025-03-04 06:50:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-03-04 06:50:02,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-03-04 06:50:02,168 INFO L175 Difference]: Start difference. First operand has 182 places, 235 transitions, 813 flow. Second operand 3 states and 481 transitions. [2025-03-04 06:50:02,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 235 transitions, 847 flow [2025-03-04 06:50:02,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 235 transitions, 841 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:02,176 INFO L231 Difference]: Finished difference. Result has 180 places, 233 transitions, 805 flow [2025-03-04 06:50:02,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=180, PETRI_TRANSITIONS=233} [2025-03-04 06:50:02,177 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 6 predicate places. [2025-03-04 06:50:02,177 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 233 transitions, 805 flow [2025-03-04 06:50:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:02,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:02,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:02,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:50:02,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:02,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 470671034, now seen corresponding path program 1 times [2025-03-04 06:50:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634567344] [2025-03-04 06:50:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:02,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:50:02,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:50:02,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:02,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634567344] [2025-03-04 06:50:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634567344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413540462] [2025-03-04 06:50:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:02,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 182 [2025-03-04 06:50:02,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 233 transitions, 805 flow. Second operand has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:02,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:02,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 182 [2025-03-04 06:50:02,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:02,856 INFO L124 PetriNetUnfolderBase]: 310/1323 cut-off events. [2025-03-04 06:50:02,856 INFO L125 PetriNetUnfolderBase]: For 435/447 co-relation queries the response was YES. [2025-03-04 06:50:02,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1323 events. 310/1323 cut-off events. For 435/447 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8367 event pairs, 57 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 2808. Up to 561 conditions per place. [2025-03-04 06:50:02,862 INFO L140 encePairwiseOnDemand]: 164/182 looper letters, 103 selfloop transitions, 53 changer transitions 0/284 dead transitions. [2025-03-04 06:50:02,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 284 transitions, 1343 flow [2025-03-04 06:50:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2025-03-04 06:50:02,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2025-03-04 06:50:02,864 INFO L175 Difference]: Start difference. First operand has 180 places, 233 transitions, 805 flow. Second operand 6 states and 872 transitions. [2025-03-04 06:50:02,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 284 transitions, 1343 flow [2025-03-04 06:50:02,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 284 transitions, 1342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:02,871 INFO L231 Difference]: Finished difference. Result has 189 places, 276 transitions, 1292 flow [2025-03-04 06:50:02,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=189, PETRI_TRANSITIONS=276} [2025-03-04 06:50:02,872 INFO L279 CegarLoopForPetriNet]: 174 programPoint places, 15 predicate places. [2025-03-04 06:50:02,872 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 276 transitions, 1292 flow [2025-03-04 06:50:02,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:02,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:02,873 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:02,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:02,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-04 06:50:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1587232155, now seen corresponding path program 1 times [2025-03-04 06:50:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211066010] [2025-03-04 06:50:02,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:02,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:50:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:50:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:02,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:02,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:50:02,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:50:02,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:02,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:02,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:02,935 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:02,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-04 06:50:02,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-04 06:50:02,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-04 06:50:02,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-04 06:50:02,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-04 06:50:02,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-04 06:50:02,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-04 06:50:02,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:02,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:02,939 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:02,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:02,979 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:02,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 252 transitions, 520 flow [2025-03-04 06:50:03,031 INFO L124 PetriNetUnfolderBase]: 27/401 cut-off events. [2025-03-04 06:50:03,032 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:03,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 401 events. 27/401 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1558 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 245. Up to 6 conditions per place. [2025-03-04 06:50:03,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 252 transitions, 520 flow [2025-03-04 06:50:03,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 252 transitions, 520 flow [2025-03-04 06:50:03,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:03,039 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;@60722df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:03,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:50:03,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:03,041 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:50:03,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:03,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:03,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:03,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1367804271, now seen corresponding path program 1 times [2025-03-04 06:50:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729951255] [2025-03-04 06:50:03,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:50:03,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:50:03,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:03,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729951255] [2025-03-04 06:50:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729951255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:03,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87423411] [2025-03-04 06:50:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:03,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:03,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:03,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 252 [2025-03-04 06:50:03,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 252 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:03,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 252 [2025-03-04 06:50:03,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:03,496 INFO L124 PetriNetUnfolderBase]: 430/3650 cut-off events. [2025-03-04 06:50:03,497 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 06:50:03,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4434 conditions, 3650 events. 430/3650 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31541 event pairs, 420 based on Foata normal form. 380/3649 useless extension candidates. Maximal degree in co-relation 3675. Up to 739 conditions per place. [2025-03-04 06:50:03,520 INFO L140 encePairwiseOnDemand]: 233/252 looper letters, 24 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2025-03-04 06:50:03,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 233 transitions, 534 flow [2025-03-04 06:50:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-04 06:50:03,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8822751322751323 [2025-03-04 06:50:03,522 INFO L175 Difference]: Start difference. First operand has 239 places, 252 transitions, 520 flow. Second operand 3 states and 667 transitions. [2025-03-04 06:50:03,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 233 transitions, 534 flow [2025-03-04 06:50:03,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:03,526 INFO L231 Difference]: Finished difference. Result has 238 places, 233 transitions, 486 flow [2025-03-04 06:50:03,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=238, PETRI_TRANSITIONS=233} [2025-03-04 06:50:03,527 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -1 predicate places. [2025-03-04 06:50:03,527 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 233 transitions, 486 flow [2025-03-04 06:50:03,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:03,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:03,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:50:03,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -199894372, now seen corresponding path program 1 times [2025-03-04 06:50:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593342907] [2025-03-04 06:50:03,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:03,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:50:03,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:50:03,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:03,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:03,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593342907] [2025-03-04 06:50:03,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593342907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:03,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:03,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159274353] [2025-03-04 06:50:03,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:03,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:03,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:03,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:03,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 252 [2025-03-04 06:50:03,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 233 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:03,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 252 [2025-03-04 06:50:03,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:03,923 INFO L124 PetriNetUnfolderBase]: 418/3585 cut-off events. [2025-03-04 06:50:03,924 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 06:50:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 3585 events. 418/3585 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 30729 event pairs, 414 based on Foata normal form. 0/3226 useless extension candidates. Maximal degree in co-relation 4309. Up to 717 conditions per place. [2025-03-04 06:50:03,944 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 22 selfloop transitions, 1 changer transitions 0/231 dead transitions. [2025-03-04 06:50:03,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 231 transitions, 528 flow [2025-03-04 06:50:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-03-04 06:50:03,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8664021164021164 [2025-03-04 06:50:03,946 INFO L175 Difference]: Start difference. First operand has 238 places, 233 transitions, 486 flow. Second operand 3 states and 655 transitions. [2025-03-04 06:50:03,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 231 transitions, 528 flow [2025-03-04 06:50:03,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:03,949 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 480 flow [2025-03-04 06:50:03,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2025-03-04 06:50:03,950 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-04 06:50:03,951 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 480 flow [2025-03-04 06:50:03,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:03,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:03,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:03,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:50:03,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:03,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -348501614, now seen corresponding path program 1 times [2025-03-04 06:50:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038173691] [2025-03-04 06:50:03,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:03,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 06:50:03,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 06:50:03,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:03,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038173691] [2025-03-04 06:50:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038173691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:03,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990362989] [2025-03-04 06:50:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:03,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:03,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:03,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:04,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 252 [2025-03-04 06:50:04,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:04,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:04,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 252 [2025-03-04 06:50:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:04,342 INFO L124 PetriNetUnfolderBase]: 564/3754 cut-off events. [2025-03-04 06:50:04,342 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 06:50:04,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3754 events. 564/3754 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 33417 event pairs, 552 based on Foata normal form. 0/3363 useless extension candidates. Maximal degree in co-relation 4729. Up to 957 conditions per place. [2025-03-04 06:50:04,386 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 26 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-04 06:50:04,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 534 flow [2025-03-04 06:50:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-04 06:50:04,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558201058201058 [2025-03-04 06:50:04,388 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 480 flow. Second operand 3 states and 647 transitions. [2025-03-04 06:50:04,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 534 flow [2025-03-04 06:50:04,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 230 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:04,391 INFO L231 Difference]: Finished difference. Result has 236 places, 230 transitions, 481 flow [2025-03-04 06:50:04,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=236, PETRI_TRANSITIONS=230} [2025-03-04 06:50:04,393 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, -3 predicate places. [2025-03-04 06:50:04,393 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 230 transitions, 481 flow [2025-03-04 06:50:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:04,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:04,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:50:04,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1784187309, now seen corresponding path program 1 times [2025-03-04 06:50:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258670672] [2025-03-04 06:50:04,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:04,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:50:04,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:50:04,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:04,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258670672] [2025-03-04 06:50:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258670672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414575797] [2025-03-04 06:50:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:04,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:04,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:04,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 252 [2025-03-04 06:50:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 230 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:04,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 252 [2025-03-04 06:50:04,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:10,300 INFO L124 PetriNetUnfolderBase]: 27081/64015 cut-off events. [2025-03-04 06:50:10,301 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2025-03-04 06:50:10,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106377 conditions, 64015 events. 27081/64015 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 708055 event pairs, 16728 based on Foata normal form. 0/59605 useless extension candidates. Maximal degree in co-relation 106338. Up to 37371 conditions per place. [2025-03-04 06:50:10,669 INFO L140 encePairwiseOnDemand]: 213/252 looper letters, 120 selfloop transitions, 134 changer transitions 0/412 dead transitions. [2025-03-04 06:50:10,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 412 transitions, 1358 flow [2025-03-04 06:50:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2025-03-04 06:50:10,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2025-03-04 06:50:10,672 INFO L175 Difference]: Start difference. First operand has 236 places, 230 transitions, 481 flow. Second operand 6 states and 1233 transitions. [2025-03-04 06:50:10,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 412 transitions, 1358 flow [2025-03-04 06:50:10,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 412 transitions, 1354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:10,689 INFO L231 Difference]: Finished difference. Result has 244 places, 363 transitions, 1355 flow [2025-03-04 06:50:10,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=244, PETRI_TRANSITIONS=363} [2025-03-04 06:50:10,691 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 5 predicate places. [2025-03-04 06:50:10,691 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 363 transitions, 1355 flow [2025-03-04 06:50:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:10,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:10,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:10,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:50:10,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1701991652, now seen corresponding path program 1 times [2025-03-04 06:50:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528207476] [2025-03-04 06:50:10,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 06:50:10,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 06:50:10,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:10,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528207476] [2025-03-04 06:50:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528207476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570347969] [2025-03-04 06:50:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:10,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:10,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:10,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:10,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 252 [2025-03-04 06:50:10,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 363 transitions, 1355 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:10,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:10,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 252 [2025-03-04 06:50:10,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:13,282 INFO L124 PetriNetUnfolderBase]: 9347/29402 cut-off events. [2025-03-04 06:50:13,282 INFO L125 PetriNetUnfolderBase]: For 4659/5158 co-relation queries the response was YES. [2025-03-04 06:50:13,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53084 conditions, 29402 events. 9347/29402 cut-off events. For 4659/5158 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 329758 event pairs, 4307 based on Foata normal form. 1/27203 useless extension candidates. Maximal degree in co-relation 53041. Up to 11206 conditions per place. [2025-03-04 06:50:13,593 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 30 selfloop transitions, 3 changer transitions 0/371 dead transitions. [2025-03-04 06:50:13,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 371 transitions, 1443 flow [2025-03-04 06:50:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2025-03-04 06:50:13,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-04 06:50:13,595 INFO L175 Difference]: Start difference. First operand has 244 places, 363 transitions, 1355 flow. Second operand 3 states and 665 transitions. [2025-03-04 06:50:13,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 371 transitions, 1443 flow [2025-03-04 06:50:13,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 371 transitions, 1443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:13,652 INFO L231 Difference]: Finished difference. Result has 247 places, 365 transitions, 1380 flow [2025-03-04 06:50:13,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1380, PETRI_PLACES=247, PETRI_TRANSITIONS=365} [2025-03-04 06:50:13,654 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2025-03-04 06:50:13,654 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 365 transitions, 1380 flow [2025-03-04 06:50:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:13,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:13,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:50:13,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1459168908, now seen corresponding path program 1 times [2025-03-04 06:50:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806115329] [2025-03-04 06:50:13,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 06:50:13,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 06:50:13,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806115329] [2025-03-04 06:50:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806115329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:13,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:50:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565975040] [2025-03-04 06:50:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:13,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:13,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:13,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 252 [2025-03-04 06:50:13,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 365 transitions, 1380 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:13,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:13,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 252 [2025-03-04 06:50:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:16,280 INFO L124 PetriNetUnfolderBase]: 9497/30318 cut-off events. [2025-03-04 06:50:16,280 INFO L125 PetriNetUnfolderBase]: For 4586/4722 co-relation queries the response was YES. [2025-03-04 06:50:16,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56222 conditions, 30318 events. 9497/30318 cut-off events. For 4586/4722 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 341063 event pairs, 3088 based on Foata normal form. 0/28718 useless extension candidates. Maximal degree in co-relation 56178. Up to 10835 conditions per place. [2025-03-04 06:50:16,479 INFO L140 encePairwiseOnDemand]: 246/252 looper letters, 34 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-03-04 06:50:16,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 370 transitions, 1467 flow [2025-03-04 06:50:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-04 06:50:16,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624338624338624 [2025-03-04 06:50:16,481 INFO L175 Difference]: Start difference. First operand has 247 places, 365 transitions, 1380 flow. Second operand 3 states and 652 transitions. [2025-03-04 06:50:16,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 370 transitions, 1467 flow [2025-03-04 06:50:16,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 370 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:16,593 INFO L231 Difference]: Finished difference. Result has 245 places, 363 transitions, 1383 flow [2025-03-04 06:50:16,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1383, PETRI_PLACES=245, PETRI_TRANSITIONS=363} [2025-03-04 06:50:16,594 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 6 predicate places. [2025-03-04 06:50:16,594 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 363 transitions, 1383 flow [2025-03-04 06:50:16,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:16,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:16,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:16,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:50:16,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -44859918, now seen corresponding path program 1 times [2025-03-04 06:50:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657767168] [2025-03-04 06:50:16,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:50:16,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:50:16,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657767168] [2025-03-04 06:50:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657767168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193832687] [2025-03-04 06:50:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:16,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:17,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 252 [2025-03-04 06:50:17,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 363 transitions, 1383 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:17,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:17,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 252 [2025-03-04 06:50:17,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:24,451 INFO L124 PetriNetUnfolderBase]: 33082/76913 cut-off events. [2025-03-04 06:50:24,452 INFO L125 PetriNetUnfolderBase]: For 31600/34605 co-relation queries the response was YES. [2025-03-04 06:50:24,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178760 conditions, 76913 events. 33082/76913 cut-off events. For 31600/34605 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 877012 event pairs, 7419 based on Foata normal form. 47/73725 useless extension candidates. Maximal degree in co-relation 178715. Up to 32092 conditions per place. [2025-03-04 06:50:24,969 INFO L140 encePairwiseOnDemand]: 204/252 looper letters, 463 selfloop transitions, 219 changer transitions 0/846 dead transitions. [2025-03-04 06:50:24,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 846 transitions, 4961 flow [2025-03-04 06:50:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1330 transitions. [2025-03-04 06:50:24,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2025-03-04 06:50:24,972 INFO L175 Difference]: Start difference. First operand has 245 places, 363 transitions, 1383 flow. Second operand 6 states and 1330 transitions. [2025-03-04 06:50:24,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 846 transitions, 4961 flow [2025-03-04 06:50:25,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 846 transitions, 4961 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:25,220 INFO L231 Difference]: Finished difference. Result has 255 places, 594 transitions, 3699 flow [2025-03-04 06:50:25,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3699, PETRI_PLACES=255, PETRI_TRANSITIONS=594} [2025-03-04 06:50:25,221 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2025-03-04 06:50:25,221 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 594 transitions, 3699 flow [2025-03-04 06:50:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:25,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:25,222 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-04 06:50:25,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:50:25,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:25,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1782653036, now seen corresponding path program 1 times [2025-03-04 06:50:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:25,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132809285] [2025-03-04 06:50:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:25,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:25,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:50:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:50:25,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:25,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:25,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:25,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132809285] [2025-03-04 06:50:25,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132809285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:25,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:25,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108355690] [2025-03-04 06:50:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:25,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:25,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:25,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 252 [2025-03-04 06:50:25,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 594 transitions, 3699 flow. Second operand has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:25,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:25,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 252 [2025-03-04 06:50:25,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:32,729 INFO L124 PetriNetUnfolderBase]: 22178/66253 cut-off events. [2025-03-04 06:50:32,729 INFO L125 PetriNetUnfolderBase]: For 49452/53230 co-relation queries the response was YES. [2025-03-04 06:50:33,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160392 conditions, 66253 events. 22178/66253 cut-off events. For 49452/53230 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 814252 event pairs, 2877 based on Foata normal form. 325/62941 useless extension candidates. Maximal degree in co-relation 160342. Up to 18287 conditions per place. [2025-03-04 06:50:33,273 INFO L140 encePairwiseOnDemand]: 247/252 looper letters, 54 selfloop transitions, 7 changer transitions 0/626 dead transitions. [2025-03-04 06:50:33,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 626 transitions, 3885 flow [2025-03-04 06:50:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1314 transitions. [2025-03-04 06:50:33,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2025-03-04 06:50:33,276 INFO L175 Difference]: Start difference. First operand has 255 places, 594 transitions, 3699 flow. Second operand 6 states and 1314 transitions. [2025-03-04 06:50:33,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 626 transitions, 3885 flow [2025-03-04 06:50:34,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 626 transitions, 3867 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:34,029 INFO L231 Difference]: Finished difference. Result has 263 places, 596 transitions, 3713 flow [2025-03-04 06:50:34,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=3681, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3713, PETRI_PLACES=263, PETRI_TRANSITIONS=596} [2025-03-04 06:50:34,030 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places. [2025-03-04 06:50:34,030 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 596 transitions, 3713 flow [2025-03-04 06:50:34,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 210.8) internal successors, (1054), 5 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:34,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:34,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:34,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:50:34,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-03-04 06:50:34,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1554312326, now seen corresponding path program 1 times [2025-03-04 06:50:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617304654] [2025-03-04 06:50:34,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 06:50:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 06:50:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:34,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617304654] [2025-03-04 06:50:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617304654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45760749] [2025-03-04 06:50:34,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:34,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:34,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:34,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 252 [2025-03-04 06:50:34,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 596 transitions, 3713 flow. Second operand has 6 states, 6 states have (on average 163.33333333333334) internal successors, (980), 6 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:34,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:34,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 252 [2025-03-04 06:50:34,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand