./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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_11-ptr_racing.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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:24:49,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:24:49,280 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:24:49,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:24:49,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:24:49,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:24:49,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:24:49,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:24:49,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:24:49,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:24:49,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:24:49,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:24:49,319 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:24:49,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:24:49,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:49,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:24:49,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:24:49,324 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-02-06 09:24:49,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:24:49,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:24:49,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:24:49,546 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:24:49,546 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:24:49,547 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_11-ptr_racing.i [2025-02-06 09:24:50,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/333548a5a/170ba00812b340179f4dd378b098d8ad/FLAG2a424926b [2025-02-06 09:24:51,143 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:24:51,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-02-06 09:24:51,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/333548a5a/170ba00812b340179f4dd378b098d8ad/FLAG2a424926b [2025-02-06 09:24:51,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/333548a5a/170ba00812b340179f4dd378b098d8ad [2025-02-06 09:24:51,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:24:51,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:24:51,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:51,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:24:51,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:24:51,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f6108d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51, skipping insertion in model container [2025-02-06 09:24:51,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:24:51,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:51,608 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:24:51,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:24:51,663 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:24:51,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51 WrapperNode [2025-02-06 09:24:51,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:24:51,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:51,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:24:51,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:24:51,669 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:24:51" (1/1) ... [2025-02-06 09:24:51,678 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:24:51" (1/1) ... [2025-02-06 09:24:51,693 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-02-06 09:24:51,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:24:51,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:24:51,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:24:51,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:24:51,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:24:51,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:24:51,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:24:51,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:24:51,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (1/1) ... [2025-02-06 09:24:51,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:24:51,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:24:51,745 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:24:51,747 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:24:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:24:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:24:51,763 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:24:51,764 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:24:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:24:51,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:24:51,765 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:24:51,920 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:24:51,922 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:24:52,064 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:24:52,064 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L708-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:24:52,155 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:24:52,156 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:24:52,188 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:24:52,191 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:24:52,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:52 BoogieIcfgContainer [2025-02-06 09:24:52,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:24:52,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:24:52,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:24:52,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:24:52,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:24:51" (1/3) ... [2025-02-06 09:24:52,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569605b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:52, skipping insertion in model container [2025-02-06 09:24:52,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:24:51" (2/3) ... [2025-02-06 09:24:52,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569605b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:24:52, skipping insertion in model container [2025-02-06 09:24:52,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:24:52" (3/3) ... [2025-02-06 09:24:52,200 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-02-06 09:24:52,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:24:52,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 161 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-02-06 09:24:52,216 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:24:52,273 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:24:52,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 172 transitions, 351 flow [2025-02-06 09:24:52,355 INFO L124 PetriNetUnfolderBase]: 15/235 cut-off events. [2025-02-06 09:24:52,356 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:24:52,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 235 events. 15/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 751 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2025-02-06 09:24:52,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 172 transitions, 351 flow [2025-02-06 09:24:52,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 172 transitions, 351 flow [2025-02-06 09:24:52,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:52,402 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;@4009bc76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:52,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-06 09:24:52,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:52,416 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-02-06 09:24:52,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:52,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:52,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:52,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1992768156, now seen corresponding path program 1 times [2025-02-06 09:24:52,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:52,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551731844] [2025-02-06 09:24:52,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:52,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:24:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:24:52,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:53,085 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:24:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:53,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551731844] [2025-02-06 09:24:53,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551731844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:53,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:53,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:53,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478784747] [2025-02-06 09:24:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:53,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:53,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 172 [2025-02-06 09:24:53,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 172 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:24:53,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:53,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 172 [2025-02-06 09:24:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:54,039 INFO L124 PetriNetUnfolderBase]: 579/2186 cut-off events. [2025-02-06 09:24:54,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:24:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 2186 events. 579/2186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15261 event pairs, 343 based on Foata normal form. 247/2270 useless extension candidates. Maximal degree in co-relation 3294. Up to 1080 conditions per place. [2025-02-06 09:24:54,050 INFO L140 encePairwiseOnDemand]: 139/172 looper letters, 73 selfloop transitions, 70 changer transitions 0/253 dead transitions. [2025-02-06 09:24:54,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 799 flow [2025-02-06 09:24:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:24:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:24:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2025-02-06 09:24:54,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8178294573643411 [2025-02-06 09:24:54,063 INFO L175 Difference]: Start difference. First operand has 164 places, 172 transitions, 351 flow. Second operand 6 states and 844 transitions. [2025-02-06 09:24:54,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 799 flow [2025-02-06 09:24:54,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 253 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:54,074 INFO L231 Difference]: Finished difference. Result has 172 places, 229 transitions, 789 flow [2025-02-06 09:24:54,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=172, PETRI_TRANSITIONS=229} [2025-02-06 09:24:54,078 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places. [2025-02-06 09:24:54,079 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 229 transitions, 789 flow [2025-02-06 09:24:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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:24:54,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,079 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] [2025-02-06 09:24:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:24:54,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1578796791, now seen corresponding path program 1 times [2025-02-06 09:24:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417407987] [2025-02-06 09:24:54,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:24:54,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:24:54,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:54,119 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:24:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417407987] [2025-02-06 09:24:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417407987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:24:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709715932] [2025-02-06 09:24:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:24:54,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:54,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:24:54,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:24:54,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 172 [2025-02-06 09:24:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 229 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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:24:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 172 [2025-02-06 09:24:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:24:54,273 INFO L124 PetriNetUnfolderBase]: 188/1078 cut-off events. [2025-02-06 09:24:54,274 INFO L125 PetriNetUnfolderBase]: For 119/136 co-relation queries the response was YES. [2025-02-06 09:24:54,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1078 events. 188/1078 cut-off events. For 119/136 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6282 event pairs, 28 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 1656. Up to 191 conditions per place. [2025-02-06 09:24:54,278 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 22 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2025-02-06 09:24:54,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 235 transitions, 851 flow [2025-02-06 09:24:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:24:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:24:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-02-06 09:24:54,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8798449612403101 [2025-02-06 09:24:54,280 INFO L175 Difference]: Start difference. First operand has 172 places, 229 transitions, 789 flow. Second operand 3 states and 454 transitions. [2025-02-06 09:24:54,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 235 transitions, 851 flow [2025-02-06 09:24:54,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:24:54,286 INFO L231 Difference]: Finished difference. Result has 175 places, 229 transitions, 800 flow [2025-02-06 09:24:54,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=175, PETRI_TRANSITIONS=229} [2025-02-06 09:24:54,287 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 11 predicate places. [2025-02-06 09:24:54,287 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 229 transitions, 800 flow [2025-02-06 09:24:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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:24:54,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,288 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:54,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:24:54,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-02-06 09:24:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 33915674, now seen corresponding path program 1 times [2025-02-06 09:24:54,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031923047] [2025-02-06 09:24:54,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:24:54,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:24:54,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:54,309 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:24:54,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:24:54,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:24:54,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:24:54,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:24:54,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:24:54,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-02-06 09:24:54,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-02-06 09:24:54,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-02-06 09:24:54,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-02-06 09:24:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:24:54,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:24:54,343 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:24:54,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:24:54,378 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:24:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 240 transitions, 496 flow [2025-02-06 09:24:54,423 INFO L124 PetriNetUnfolderBase]: 27/393 cut-off events. [2025-02-06 09:24:54,423 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:24:54,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 393 events. 27/393 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1522 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 237. Up to 6 conditions per place. [2025-02-06 09:24:54,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 240 transitions, 496 flow [2025-02-06 09:24:54,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 240 transitions, 496 flow [2025-02-06 09:24:54,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:24:54,429 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;@4009bc76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:24:54,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 09:24:54,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:24:54,435 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-02-06 09:24:54,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:24:54,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:24:54,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:24:54,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:24:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:24:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1271746204, now seen corresponding path program 1 times [2025-02-06 09:24:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:24:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112792421] [2025-02-06 09:24:54,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:24:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:24:54,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:24:54,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:24:54,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:24:54,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:24:54,688 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:24:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:24:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112792421] [2025-02-06 09:24:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112792421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:24:54,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:24:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:24:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216651670] [2025-02-06 09:24:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:24:54,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:24:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:24:54,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:24:54,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:24:54,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 240 [2025-02-06 09:24:54,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 240 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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:24:54,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:24:54,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 240 [2025-02-06 09:24:54,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:00,798 INFO L124 PetriNetUnfolderBase]: 29150/68434 cut-off events. [2025-02-06 09:25:00,798 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2025-02-06 09:25:00,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113968 conditions, 68434 events. 29150/68434 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 762437 event pairs, 19147 based on Foata normal form. 10200/74562 useless extension candidates. Maximal degree in co-relation 99685. Up to 40547 conditions per place. [2025-02-06 09:25:01,299 INFO L140 encePairwiseOnDemand]: 185/240 looper letters, 122 selfloop transitions, 134 changer transitions 0/404 dead transitions. [2025-02-06 09:25:01,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 404 transitions, 1341 flow [2025-02-06 09:25:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1215 transitions. [2025-02-06 09:25:01,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84375 [2025-02-06 09:25:01,314 INFO L175 Difference]: Start difference. First operand has 227 places, 240 transitions, 496 flow. Second operand 6 states and 1215 transitions. [2025-02-06 09:25:01,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 404 transitions, 1341 flow [2025-02-06 09:25:01,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 404 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:01,358 INFO L231 Difference]: Finished difference. Result has 235 places, 355 transitions, 1338 flow [2025-02-06 09:25:01,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1338, PETRI_PLACES=235, PETRI_TRANSITIONS=355} [2025-02-06 09:25:01,359 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 8 predicate places. [2025-02-06 09:25:01,359 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 355 transitions, 1338 flow [2025-02-06 09:25:01,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 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:01,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:01,361 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] [2025-02-06 09:25:01,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:01,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:25:01,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 745510375, now seen corresponding path program 1 times [2025-02-06 09:25:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:01,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859472555] [2025-02-06 09:25:01,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:01,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:01,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:25:01,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:25:01,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:01,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:01,444 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:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859472555] [2025-02-06 09:25:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859472555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402054084] [2025-02-06 09:25:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:01,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:01,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:01,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 240 [2025-02-06 09:25:01,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 355 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 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:01,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:01,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 240 [2025-02-06 09:25:01,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:04,427 INFO L124 PetriNetUnfolderBase]: 9785/31056 cut-off events. [2025-02-06 09:25:04,427 INFO L125 PetriNetUnfolderBase]: For 5112/5471 co-relation queries the response was YES. [2025-02-06 09:25:04,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55435 conditions, 31056 events. 9785/31056 cut-off events. For 5112/5471 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 351454 event pairs, 3938 based on Foata normal form. 1/28537 useless extension candidates. Maximal degree in co-relation 51346. Up to 9263 conditions per place. [2025-02-06 09:25:04,604 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 32 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2025-02-06 09:25:04,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 363 transitions, 1430 flow [2025-02-06 09:25:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2025-02-06 09:25:04,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2025-02-06 09:25:04,607 INFO L175 Difference]: Start difference. First operand has 235 places, 355 transitions, 1338 flow. Second operand 3 states and 625 transitions. [2025-02-06 09:25:04,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 363 transitions, 1430 flow [2025-02-06 09:25:04,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 363 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:04,701 INFO L231 Difference]: Finished difference. Result has 238 places, 357 transitions, 1363 flow [2025-02-06 09:25:04,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=238, PETRI_TRANSITIONS=357} [2025-02-06 09:25:04,704 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 11 predicate places. [2025-02-06 09:25:04,704 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 357 transitions, 1363 flow [2025-02-06 09:25:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 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:04,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:04,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:04,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:04,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:25:04,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 230013963, now seen corresponding path program 1 times [2025-02-06 09:25:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869250806] [2025-02-06 09:25:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:04,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:25:04,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:25:04,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:04,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:04,932 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:04,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869250806] [2025-02-06 09:25:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869250806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:04,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:04,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24302877] [2025-02-06 09:25:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:04,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:04,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:05,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2025-02-06 09:25:05,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 357 transitions, 1363 flow. Second operand has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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:05,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:05,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2025-02-06 09:25:05,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:10,820 INFO L124 PetriNetUnfolderBase]: 22809/57426 cut-off events. [2025-02-06 09:25:10,821 INFO L125 PetriNetUnfolderBase]: For 20693/22160 co-relation queries the response was YES. [2025-02-06 09:25:10,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124963 conditions, 57426 events. 22809/57426 cut-off events. For 20693/22160 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 651244 event pairs, 7749 based on Foata normal form. 50/54088 useless extension candidates. Maximal degree in co-relation 124790. Up to 26569 conditions per place. [2025-02-06 09:25:11,151 INFO L140 encePairwiseOnDemand]: 214/240 looper letters, 192 selfloop transitions, 141 changer transitions 0/536 dead transitions. [2025-02-06 09:25:11,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 536 transitions, 2831 flow [2025-02-06 09:25:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1171 transitions. [2025-02-06 09:25:11,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8131944444444444 [2025-02-06 09:25:11,154 INFO L175 Difference]: Start difference. First operand has 238 places, 357 transitions, 1363 flow. Second operand 6 states and 1171 transitions. [2025-02-06 09:25:11,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 536 transitions, 2831 flow [2025-02-06 09:25:11,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 536 transitions, 2828 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:11,300 INFO L231 Difference]: Finished difference. Result has 247 places, 488 transitions, 2744 flow [2025-02-06 09:25:11,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2744, PETRI_PLACES=247, PETRI_TRANSITIONS=488} [2025-02-06 09:25:11,301 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 20 predicate places. [2025-02-06 09:25:11,301 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 488 transitions, 2744 flow [2025-02-06 09:25:11,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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:11,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:11,302 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] [2025-02-06 09:25:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:11,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:25:11,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:11,303 INFO L85 PathProgramCache]: Analyzing trace with hash 134663227, now seen corresponding path program 1 times [2025-02-06 09:25:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000516533] [2025-02-06 09:25:11,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:11,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 09:25:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 09:25:11,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:11,361 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:11,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000516533] [2025-02-06 09:25:11,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000516533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:11,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:11,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528076574] [2025-02-06 09:25:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:11,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:11,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:11,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 240 [2025-02-06 09:25:11,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 488 transitions, 2744 flow. Second operand has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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:11,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:11,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 240 [2025-02-06 09:25:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:15,969 INFO L124 PetriNetUnfolderBase]: 14480/43570 cut-off events. [2025-02-06 09:25:15,969 INFO L125 PetriNetUnfolderBase]: For 25273/27718 co-relation queries the response was YES. [2025-02-06 09:25:16,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96908 conditions, 43570 events. 14480/43570 cut-off events. For 25273/27718 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 504682 event pairs, 2041 based on Foata normal form. 43/40192 useless extension candidates. Maximal degree in co-relation 78180. Up to 12179 conditions per place. [2025-02-06 09:25:16,252 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 56 selfloop transitions, 7 changer transitions 0/520 dead transitions. [2025-02-06 09:25:16,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 520 transitions, 2934 flow [2025-02-06 09:25:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1232 transitions. [2025-02-06 09:25:16,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2025-02-06 09:25:16,255 INFO L175 Difference]: Start difference. First operand has 247 places, 488 transitions, 2744 flow. Second operand 6 states and 1232 transitions. [2025-02-06 09:25:16,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 520 transitions, 2934 flow [2025-02-06 09:25:16,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 520 transitions, 2916 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:16,488 INFO L231 Difference]: Finished difference. Result has 255 places, 490 transitions, 2758 flow [2025-02-06 09:25:16,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2726, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2758, PETRI_PLACES=255, PETRI_TRANSITIONS=490} [2025-02-06 09:25:16,489 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 28 predicate places. [2025-02-06 09:25:16,489 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 490 transitions, 2758 flow [2025-02-06 09:25:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 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:16,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:16,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:16,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:25:16,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:25:16,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:16,490 INFO L85 PathProgramCache]: Analyzing trace with hash 516488756, now seen corresponding path program 1 times [2025-02-06 09:25:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:16,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180127476] [2025-02-06 09:25:16,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:16,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:16,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 09:25:16,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 09:25:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:16,706 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:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:16,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180127476] [2025-02-06 09:25:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180127476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184997197] [2025-02-06 09:25:16,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:16,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:16,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 240 [2025-02-06 09:25:16,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 490 transitions, 2758 flow. Second operand has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 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:16,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:16,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 240 [2025-02-06 09:25:16,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:27,812 INFO L124 PetriNetUnfolderBase]: 44847/102991 cut-off events. [2025-02-06 09:25:27,812 INFO L125 PetriNetUnfolderBase]: For 69282/73782 co-relation queries the response was YES. [2025-02-06 09:25:28,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260404 conditions, 102991 events. 44847/102991 cut-off events. For 69282/73782 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 1187151 event pairs, 22605 based on Foata normal form. 115/97387 useless extension candidates. Maximal degree in co-relation 231577. Up to 64117 conditions per place. [2025-02-06 09:25:28,511 INFO L140 encePairwiseOnDemand]: 205/240 looper letters, 372 selfloop transitions, 245 changer transitions 0/773 dead transitions. [2025-02-06 09:25:28,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 773 transitions, 5450 flow [2025-02-06 09:25:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2025-02-06 09:25:28,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944444444444444 [2025-02-06 09:25:28,518 INFO L175 Difference]: Start difference. First operand has 255 places, 490 transitions, 2758 flow. Second operand 6 states and 1144 transitions. [2025-02-06 09:25:28,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 773 transitions, 5450 flow [2025-02-06 09:25:28,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 773 transitions, 5440 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:28,845 INFO L231 Difference]: Finished difference. Result has 263 places, 725 transitions, 5266 flow [2025-02-06 09:25:28,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2748, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5266, PETRI_PLACES=263, PETRI_TRANSITIONS=725} [2025-02-06 09:25:28,848 INFO L279 CegarLoopForPetriNet]: 227 programPoint places, 36 predicate places. [2025-02-06 09:25:28,848 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 725 transitions, 5266 flow [2025-02-06 09:25:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 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:28,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:28,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:28,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:25:28,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-06 09:25:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 953270389, now seen corresponding path program 1 times [2025-02-06 09:25:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:28,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324054369] [2025-02-06 09:25:28,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:28,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 09:25:28,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 09:25:28,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:28,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:29,257 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:29,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:29,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324054369] [2025-02-06 09:25:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324054369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:25:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584448993] [2025-02-06 09:25:29,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:25:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:29,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:25:29,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:25:29,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 240 [2025-02-06 09:25:29,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 725 transitions, 5266 flow. Second operand has 11 states, 11 states have (on average 147.0) internal successors, (1617), 11 states have internal predecessors, (1617), 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:29,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:29,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 240 [2025-02-06 09:25:29,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand