./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:25:38,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:25:38,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:25:38,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:25:38,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:25:38,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:25:38,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:25:38,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:25:38,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:25:38,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:25:38,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:25:38,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:25:38,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:25:38,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:25:38,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:38,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:25:38,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:25:38,762 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-jdk21/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 -> 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 [2025-02-06 09:25:38,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:25:38,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:25:38,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:25:38,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:25:38,965 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:25:38,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-02-06 09:25:40,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d05332f5/ba1c3472f6644742bd07ee555157a6a3/FLAG3bfbe2c1d [2025-02-06 09:25:40,401 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:25:40,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-02-06 09:25:40,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d05332f5/ba1c3472f6644742bd07ee555157a6a3/FLAG3bfbe2c1d [2025-02-06 09:25:40,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d05332f5/ba1c3472f6644742bd07ee555157a6a3 [2025-02-06 09:25:40,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:25:40,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:25:40,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:40,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:25:40,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:25:40,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:40" (1/1) ... [2025-02-06 09:25:40,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eb93b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:40, skipping insertion in model container [2025-02-06 09:25:40,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:40" (1/1) ... [2025-02-06 09:25:40,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:25:40,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:40,941 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:25:40,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:41,011 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:25:41,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41 WrapperNode [2025-02-06 09:25:41,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:41,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:41,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:25:41,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:25:41,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,039 INFO L138 Inliner]: procedures = 172, calls = 61, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 165 [2025-02-06 09:25:41,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:41,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:25:41,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:25:41,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:25:41,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:25:41,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:25:41,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:25:41,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:25:41,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (1/1) ... [2025-02-06 09:25:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:25:41,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:25:41,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:25:41,124 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:25:41,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:25:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:25:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-02-06 09:25:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:25:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:25:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:25:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:25:41,126 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:25:41,203 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:25:41,204 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:25:41,379 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:25:41,380 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:25:41,465 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:25:41,466 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:25:41,531 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:25:41,531 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:25:41,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:41 BoogieIcfgContainer [2025-02-06 09:25:41,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:25:41,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:25:41,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:25:41,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:25:41,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:25:40" (1/3) ... [2025-02-06 09:25:41,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b470f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:41, skipping insertion in model container [2025-02-06 09:25:41,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:41" (2/3) ... [2025-02-06 09:25:41,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b470f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:41, skipping insertion in model container [2025-02-06 09:25:41,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:41" (3/3) ... [2025-02-06 09:25:41,544 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2025-02-06 09:25:41,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:25:41,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_42-trylock2_racefree.i that has 2 procedures, 249 locations, 1 initial locations, 13 loop locations, and 14 error locations. [2025-02-06 09:25:41,561 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:25:41,637 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:25:41,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 280 transitions, 567 flow [2025-02-06 09:25:41,791 INFO L124 PetriNetUnfolderBase]: 49/423 cut-off events. [2025-02-06 09:25:41,792 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:25:41,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 423 events. 49/423 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2035 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 241. Up to 6 conditions per place. [2025-02-06 09:25:41,803 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 280 transitions, 567 flow [2025-02-06 09:25:41,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 280 transitions, 567 flow [2025-02-06 09:25:41,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:41,833 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;@7b2706d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:41,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:25:41,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:41,848 INFO L124 PetriNetUnfolderBase]: 1/63 cut-off events. [2025-02-06 09:25:41,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:41,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:41,849 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] [2025-02-06 09:25:41,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:41,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1450167642, now seen corresponding path program 1 times [2025-02-06 09:25:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:41,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-02-06 09:25:41,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:41,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:41,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:41,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:41,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:42,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:42,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655331817] [2025-02-06 09:25:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655331817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:42,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:42,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926378742] [2025-02-06 09:25:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:42,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:42,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:42,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:42,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 280 [2025-02-06 09:25:42,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 280 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-02-06 09:25:42,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:42,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 280 [2025-02-06 09:25:42,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:42,499 INFO L124 PetriNetUnfolderBase]: 229/1862 cut-off events. [2025-02-06 09:25:42,499 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:25:42,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1862 events. 229/1862 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 12630 event pairs, 187 based on Foata normal form. 445/2117 useless extension candidates. Maximal degree in co-relation 2257. Up to 454 conditions per place. [2025-02-06 09:25:42,513 INFO L140 encePairwiseOnDemand]: 248/280 looper letters, 44 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-02-06 09:25:42,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 255 transitions, 609 flow [2025-02-06 09:25:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2025-02-06 09:25:42,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8654761904761905 [2025-02-06 09:25:42,531 INFO L175 Difference]: Start difference. First operand has 252 places, 280 transitions, 567 flow. Second operand 3 states and 727 transitions. [2025-02-06 09:25:42,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 255 transitions, 609 flow [2025-02-06 09:25:42,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 255 transitions, 609 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:42,541 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 501 flow [2025-02-06 09:25:42,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2025-02-06 09:25:42,545 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -5 predicate places. [2025-02-06 09:25:42,547 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 501 flow [2025-02-06 09:25:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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-02-06 09:25:42,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:42,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:42,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:25:42,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:42,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -813097979, now seen corresponding path program 1 times [2025-02-06 09:25:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:42,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084921089] [2025-02-06 09:25:42,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:42,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:42,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:42,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:43,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084921089] [2025-02-06 09:25:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084921089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466041041] [2025-02-06 09:25:43,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:43,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:43,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:43,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:43,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 280 [2025-02-06 09:25:43,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-02-06 09:25:43,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:43,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 280 [2025-02-06 09:25:43,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:43,574 INFO L124 PetriNetUnfolderBase]: 338/2465 cut-off events. [2025-02-06 09:25:43,574 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 09:25:43,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 2465 events. 338/2465 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 17782 event pairs, 254 based on Foata normal form. 0/2217 useless extension candidates. Maximal degree in co-relation 3129. Up to 587 conditions per place. [2025-02-06 09:25:43,586 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 88 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2025-02-06 09:25:43,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 290 transitions, 781 flow [2025-02-06 09:25:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1300 transitions. [2025-02-06 09:25:43,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7738095238095238 [2025-02-06 09:25:43,591 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 501 flow. Second operand 6 states and 1300 transitions. [2025-02-06 09:25:43,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 290 transitions, 781 flow [2025-02-06 09:25:43,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 290 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:43,597 INFO L231 Difference]: Finished difference. Result has 249 places, 242 transitions, 505 flow [2025-02-06 09:25:43,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=249, PETRI_TRANSITIONS=242} [2025-02-06 09:25:43,600 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -3 predicate places. [2025-02-06 09:25:43,600 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 242 transitions, 505 flow [2025-02-06 09:25:43,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 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-02-06 09:25:43,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:43,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:43,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:25:43,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 288134959, now seen corresponding path program 1 times [2025-02-06 09:25:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-02-06 09:25:43,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:43,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:25:43,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:25:43,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:43,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-02-06 09:25:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025402791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933756502] [2025-02-06 09:25:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:43,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 280 [2025-02-06 09:25:43,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 242 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-06 09:25:43,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:43,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 280 [2025-02-06 09:25:43,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:44,045 INFO L124 PetriNetUnfolderBase]: 596/3916 cut-off events. [2025-02-06 09:25:44,046 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:25:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5174 conditions, 3916 events. 596/3916 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33172 event pairs, 110 based on Foata normal form. 0/3549 useless extension candidates. Maximal degree in co-relation 5104. Up to 735 conditions per place. [2025-02-06 09:25:44,061 INFO L140 encePairwiseOnDemand]: 265/280 looper letters, 68 selfloop transitions, 10 changer transitions 0/275 dead transitions. [2025-02-06 09:25:44,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 275 transitions, 730 flow [2025-02-06 09:25:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2025-02-06 09:25:44,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8202380952380952 [2025-02-06 09:25:44,063 INFO L175 Difference]: Start difference. First operand has 249 places, 242 transitions, 505 flow. Second operand 3 states and 689 transitions. [2025-02-06 09:25:44,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 275 transitions, 730 flow [2025-02-06 09:25:44,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 275 transitions, 720 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:44,067 INFO L231 Difference]: Finished difference. Result has 246 places, 248 transitions, 569 flow [2025-02-06 09:25:44,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=246, PETRI_TRANSITIONS=248} [2025-02-06 09:25:44,068 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-02-06 09:25:44,068 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 248 transitions, 569 flow [2025-02-06 09:25:44,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-02-06 09:25:44,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:44,069 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:44,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:25:44,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:44,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1575522994, now seen corresponding path program 1 times [2025-02-06 09:25:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059874580] [2025-02-06 09:25:44,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:44,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:25:44,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:25:44,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:44,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:44,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:44,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:25:44,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:25:44,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:44,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:44,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:44,111 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:44,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-06 09:25:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-06 09:25:44,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-06 09:25:44,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-06 09:25:44,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-06 09:25:44,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:44,116 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:25:44,118 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:44,118 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:25:44,161 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:25:44,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 377 transitions, 770 flow [2025-02-06 09:25:44,216 INFO L124 PetriNetUnfolderBase]: 81/690 cut-off events. [2025-02-06 09:25:44,216 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:25:44,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 690 events. 81/690 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3623 event pairs, 0 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 425. Up to 9 conditions per place. [2025-02-06 09:25:44,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 377 transitions, 770 flow [2025-02-06 09:25:44,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 377 transitions, 770 flow [2025-02-06 09:25:44,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:44,229 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;@7b2706d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:44,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-06 09:25:44,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:44,233 INFO L124 PetriNetUnfolderBase]: 1/63 cut-off events. [2025-02-06 09:25:44,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:44,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:44,233 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] [2025-02-06 09:25:44,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:25:44,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1362165690, now seen corresponding path program 1 times [2025-02-06 09:25:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643015606] [2025-02-06 09:25:44,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:44,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:25:44,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:25:44,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643015606] [2025-02-06 09:25:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643015606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:44,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091583199] [2025-02-06 09:25:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:44,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:44,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:44,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 377 [2025-02-06 09:25:44,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 377 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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-02-06 09:25:44,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:44,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 377 [2025-02-06 09:25:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:47,463 INFO L124 PetriNetUnfolderBase]: 6044/29107 cut-off events. [2025-02-06 09:25:47,464 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-02-06 09:25:47,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38706 conditions, 29107 events. 6044/29107 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 359538 event pairs, 5482 based on Foata normal form. 9225/36086 useless extension candidates. Maximal degree in co-relation 30482. Up to 9513 conditions per place. [2025-02-06 09:25:47,641 INFO L140 encePairwiseOnDemand]: 333/377 looper letters, 59 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-06 09:25:47,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 341 transitions, 820 flow [2025-02-06 09:25:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2025-02-06 09:25:47,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8549955791335102 [2025-02-06 09:25:47,644 INFO L175 Difference]: Start difference. First operand has 338 places, 377 transitions, 770 flow. Second operand 3 states and 967 transitions. [2025-02-06 09:25:47,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 341 transitions, 820 flow [2025-02-06 09:25:47,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 341 transitions, 820 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:47,652 INFO L231 Difference]: Finished difference. Result has 333 places, 329 transitions, 684 flow [2025-02-06 09:25:47,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=333, PETRI_TRANSITIONS=329} [2025-02-06 09:25:47,654 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -5 predicate places. [2025-02-06 09:25:47,654 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 329 transitions, 684 flow [2025-02-06 09:25:47,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 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-02-06 09:25:47,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:47,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:47,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:47,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:25:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1914962910, now seen corresponding path program 1 times [2025-02-06 09:25:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923717419] [2025-02-06 09:25:47,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:47,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:47,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:47,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:47,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923717419] [2025-02-06 09:25:47,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923717419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:47,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:47,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670938589] [2025-02-06 09:25:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:47,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:47,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:47,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:48,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 377 [2025-02-06 09:25:48,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 329 transitions, 684 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-02-06 09:25:48,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:48,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 377 [2025-02-06 09:25:48,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:51,502 INFO L124 PetriNetUnfolderBase]: 9520/34381 cut-off events. [2025-02-06 09:25:51,503 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2025-02-06 09:25:51,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49557 conditions, 34381 events. 9520/34381 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 415862 event pairs, 804 based on Foata normal form. 0/31807 useless extension candidates. Maximal degree in co-relation 3827. Up to 11851 conditions per place. [2025-02-06 09:25:51,661 INFO L140 encePairwiseOnDemand]: 371/377 looper letters, 150 selfloop transitions, 6 changer transitions 0/424 dead transitions. [2025-02-06 09:25:51,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 424 transitions, 1186 flow [2025-02-06 09:25:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1788 transitions. [2025-02-06 09:25:51,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7904509283819628 [2025-02-06 09:25:51,665 INFO L175 Difference]: Start difference. First operand has 333 places, 329 transitions, 684 flow. Second operand 6 states and 1788 transitions. [2025-02-06 09:25:51,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 424 transitions, 1186 flow [2025-02-06 09:25:51,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 424 transitions, 1184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:51,670 INFO L231 Difference]: Finished difference. Result has 336 places, 328 transitions, 692 flow [2025-02-06 09:25:51,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=336, PETRI_TRANSITIONS=328} [2025-02-06 09:25:51,671 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -2 predicate places. [2025-02-06 09:25:51,671 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 328 transitions, 692 flow [2025-02-06 09:25:51,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-02-06 09:25:51,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:51,672 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-02-06 09:25:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:51,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:25:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1995744791, now seen corresponding path program 1 times [2025-02-06 09:25:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144768499] [2025-02-06 09:25:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:51,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:25:51,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:25:51,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:25:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144768499] [2025-02-06 09:25:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144768499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:51,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:51,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:51,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695467679] [2025-02-06 09:25:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:51,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:51,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:51,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:51,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 377 [2025-02-06 09:25:51,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 328 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-02-06 09:25:51,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:51,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 377 [2025-02-06 09:25:51,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:01,528 INFO L124 PetriNetUnfolderBase]: 30965/111901 cut-off events. [2025-02-06 09:26:01,528 INFO L125 PetriNetUnfolderBase]: For 330/330 co-relation queries the response was YES. [2025-02-06 09:26:01,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160439 conditions, 111901 events. 30965/111901 cut-off events. For 330/330 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 1604321 event pairs, 10342 based on Foata normal form. 0/100181 useless extension candidates. Maximal degree in co-relation 128316. Up to 26160 conditions per place. [2025-02-06 09:26:02,139 INFO L140 encePairwiseOnDemand]: 352/377 looper letters, 108 selfloop transitions, 18 changer transitions 0/387 dead transitions. [2025-02-06 09:26:02,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 387 transitions, 1073 flow [2025-02-06 09:26:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-02-06 09:26:02,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2025-02-06 09:26:02,142 INFO L175 Difference]: Start difference. First operand has 336 places, 328 transitions, 692 flow. Second operand 3 states and 928 transitions. [2025-02-06 09:26:02,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 387 transitions, 1073 flow [2025-02-06 09:26:02,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 387 transitions, 1061 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:26:02,147 INFO L231 Difference]: Finished difference. Result has 335 places, 346 transitions, 838 flow [2025-02-06 09:26:02,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=335, PETRI_TRANSITIONS=346} [2025-02-06 09:26:02,148 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -3 predicate places. [2025-02-06 09:26:02,148 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 346 transitions, 838 flow [2025-02-06 09:26:02,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 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-02-06 09:26:02,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:02,149 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] [2025-02-06 09:26:02,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:26:02,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:26:02,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash 230468143, now seen corresponding path program 1 times [2025-02-06 09:26:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006228920] [2025-02-06 09:26:02,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:02,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:26:02,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:26:02,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:02,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006228920] [2025-02-06 09:26:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006228920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074416182] [2025-02-06 09:26:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:02,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:02,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:02,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 377 [2025-02-06 09:26:02,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 346 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-02-06 09:26:02,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:02,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 377 [2025-02-06 09:26:02,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:13,961 INFO L124 PetriNetUnfolderBase]: 30402/124027 cut-off events. [2025-02-06 09:26:13,962 INFO L125 PetriNetUnfolderBase]: For 20063/20610 co-relation queries the response was YES. [2025-02-06 09:26:14,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191186 conditions, 124027 events. 30402/124027 cut-off events. For 20063/20610 co-relation queries the response was YES. Maximal size of possible extension queue 1755. Compared 1866949 event pairs, 21739 based on Foata normal form. 148/112816 useless extension candidates. Maximal degree in co-relation 185230. Up to 42772 conditions per place. [2025-02-06 09:26:14,747 INFO L140 encePairwiseOnDemand]: 366/377 looper letters, 94 selfloop transitions, 18 changer transitions 0/390 dead transitions. [2025-02-06 09:26:14,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 390 transitions, 1200 flow [2025-02-06 09:26:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2025-02-06 09:26:14,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8134394341290893 [2025-02-06 09:26:14,749 INFO L175 Difference]: Start difference. First operand has 335 places, 346 transitions, 838 flow. Second operand 3 states and 920 transitions. [2025-02-06 09:26:14,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 390 transitions, 1200 flow [2025-02-06 09:26:14,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 390 transitions, 1150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:14,791 INFO L231 Difference]: Finished difference. Result has 337 places, 362 transitions, 968 flow [2025-02-06 09:26:14,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=337, PETRI_TRANSITIONS=362} [2025-02-06 09:26:14,792 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, -1 predicate places. [2025-02-06 09:26:14,793 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 362 transitions, 968 flow [2025-02-06 09:26:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-02-06 09:26:14,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:14,793 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] [2025-02-06 09:26:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:26:14,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:26:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2013504386, now seen corresponding path program 1 times [2025-02-06 09:26:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080762894] [2025-02-06 09:26:14,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:14,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:26:14,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:26:14,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:14,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:26:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080762894] [2025-02-06 09:26:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080762894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619019253] [2025-02-06 09:26:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:14,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:26:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:14,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:26:14,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:26:14,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 377 [2025-02-06 09:26:14,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 362 transitions, 968 flow. Second operand has 5 states, 5 states have (on average 284.4) internal successors, (1422), 5 states have internal predecessors, (1422), 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-02-06 09:26:14,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:14,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 377 [2025-02-06 09:26:14,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:25,840 INFO L124 PetriNetUnfolderBase]: 21881/107814 cut-off events. [2025-02-06 09:26:25,840 INFO L125 PetriNetUnfolderBase]: For 5755/7790 co-relation queries the response was YES. [2025-02-06 09:26:26,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153141 conditions, 107814 events. 21881/107814 cut-off events. For 5755/7790 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 1681565 event pairs, 4912 based on Foata normal form. 71/98745 useless extension candidates. Maximal degree in co-relation 94497. Up to 30225 conditions per place. [2025-02-06 09:26:26,566 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 108 selfloop transitions, 5 changer transitions 0/424 dead transitions. [2025-02-06 09:26:26,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 424 transitions, 1318 flow [2025-02-06 09:26:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-02-06 09:26:26,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7984084880636605 [2025-02-06 09:26:26,573 INFO L175 Difference]: Start difference. First operand has 337 places, 362 transitions, 968 flow. Second operand 6 states and 1806 transitions. [2025-02-06 09:26:26,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 424 transitions, 1318 flow [2025-02-06 09:26:26,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 424 transitions, 1282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:26,623 INFO L231 Difference]: Finished difference. Result has 343 places, 364 transitions, 958 flow [2025-02-06 09:26:26,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=343, PETRI_TRANSITIONS=364} [2025-02-06 09:26:26,624 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 5 predicate places. [2025-02-06 09:26:26,624 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 364 transitions, 958 flow [2025-02-06 09:26:26,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 284.4) internal successors, (1422), 5 states have internal predecessors, (1422), 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-02-06 09:26:26,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:26,631 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 09:26:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:26:26,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-02-06 09:26:26,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -40612210, now seen corresponding path program 1 times [2025-02-06 09:26:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906986301] [2025-02-06 09:26:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:26,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 09:26:26,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 09:26:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:26,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:26,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 09:26:26,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 09:26:26,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:26,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:26,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-02-06 09:26:26,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-02-06 09:26:26,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-02-06 09:26:26,714 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-02-06 09:26:26,715 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-02-06 09:26:26,718 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-02-06 09:26:26,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:26:26,719 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:26:26,719 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:26,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:26:26,761 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:26:26,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 424 places, 474 transitions, 975 flow [2025-02-06 09:26:26,847 INFO L124 PetriNetUnfolderBase]: 116/1000 cut-off events. [2025-02-06 09:26:26,847 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:26:26,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 1000 events. 116/1000 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5422 event pairs, 1 based on Foata normal form. 0/828 useless extension candidates. Maximal degree in co-relation 698. Up to 12 conditions per place. [2025-02-06 09:26:26,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 424 places, 474 transitions, 975 flow [2025-02-06 09:26:26,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 424 places, 474 transitions, 975 flow [2025-02-06 09:26:26,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:26,881 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;@7b2706d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:26,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-06 09:26:26,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:26,884 INFO L124 PetriNetUnfolderBase]: 1/63 cut-off events. [2025-02-06 09:26:26,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:26,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:26,884 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] [2025-02-06 09:26:26,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-02-06 09:26:26,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:26,886 INFO L85 PathProgramCache]: Analyzing trace with hash 138361990, now seen corresponding path program 1 times [2025-02-06 09:26:26,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:26,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081836207] [2025-02-06 09:26:26,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:26,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:26:26,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:26:26,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:26,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:26,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081836207] [2025-02-06 09:26:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081836207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103481079] [2025-02-06 09:26:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:26,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:26,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:26,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:26,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 474 [2025-02-06 09:26:26,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 474 transitions, 975 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 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-02-06 09:26:26,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:26,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 474 [2025-02-06 09:26:26,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand