./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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_27-funptr_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 ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:25:31,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:25:31,435 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:31,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:25:31,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:25:31,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:25:31,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:25:31,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:25:31,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:25:31,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:25:31,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:25:31,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:25:31,453 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:25:31,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:25:31,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:25:31,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:31,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:25:31,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:25:31,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:25:31,456 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 -> ce37da4bed964b4727d03a98278bc58de76d7006f2d65a8a42fb0f55b5b34a9c [2025-02-06 09:25:31,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:25:31,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:25:31,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:25:31,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:25:31,696 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:25:31,697 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_27-funptr_racing.i [2025-02-06 09:25:32,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/610d0671c/ddfb7fe35ae84b42b1771d598baa65ff/FLAG55576bd90 [2025-02-06 09:25:33,164 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:25:33,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_27-funptr_racing.i [2025-02-06 09:25:33,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/610d0671c/ddfb7fe35ae84b42b1771d598baa65ff/FLAG55576bd90 [2025-02-06 09:25:33,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/610d0671c/ddfb7fe35ae84b42b1771d598baa65ff [2025-02-06 09:25:33,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:25:33,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:25:33,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:33,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:25:33,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:25:33,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:33" (1/1) ... [2025-02-06 09:25:33,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ad7abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:33, skipping insertion in model container [2025-02-06 09:25:33,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:25:33" (1/1) ... [2025-02-06 09:25:33,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:25:33,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:33,773 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:25:33,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:25:33,877 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:25:33,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:33 WrapperNode [2025-02-06 09:25:33,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:25:33,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:33,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:25:33,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:25:33,887 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:33" (1/1) ... [2025-02-06 09:25:33,898 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:33" (1/1) ... [2025-02-06 09:25:33,911 INFO L138 Inliner]: procedures = 252, calls = 53, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2025-02-06 09:25:33,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:25:33,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:25:33,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:25:33,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:25:33,916 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:33" (1/1) ... [2025-02-06 09:25:33,916 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:33" (1/1) ... [2025-02-06 09:25:33,918 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:33" (1/1) ... [2025-02-06 09:25:33,918 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:33" (1/1) ... [2025-02-06 09:25:33,922 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:33" (1/1) ... [2025-02-06 09:25:33,923 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:33" (1/1) ... [2025-02-06 09:25:33,924 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:33" (1/1) ... [2025-02-06 09:25:33,924 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:33" (1/1) ... [2025-02-06 09:25:33,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:25:33,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:25:33,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:25:33,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:25:33,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:33" (1/1) ... [2025-02-06 09:25:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:25:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:25:33,953 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:33,955 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:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:25:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:25:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:25:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:25:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:25:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:25:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:25:33,972 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:34,076 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:25:34,077 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:25:34,241 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:25:34,241 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L911-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:25:34,331 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:25:34,332 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:25:34,359 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:25:34,359 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:25:34,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:34 BoogieIcfgContainer [2025-02-06 09:25:34,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:25:34,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:25:34,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:25:34,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:25:34,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:25:33" (1/3) ... [2025-02-06 09:25:34,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3805a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:34, skipping insertion in model container [2025-02-06 09:25:34,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:25:33" (2/3) ... [2025-02-06 09:25:34,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3805a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:25:34, skipping insertion in model container [2025-02-06 09:25:34,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:25:34" (3/3) ... [2025-02-06 09:25:34,365 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_27-funptr_racing.i [2025-02-06 09:25:34,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:25:34,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_27-funptr_racing.i that has 2 procedures, 200 locations, 1 initial locations, 9 loop locations, and 13 error locations. [2025-02-06 09:25:34,375 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:25:34,437 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:25:34,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 218 transitions, 443 flow [2025-02-06 09:25:34,568 INFO L124 PetriNetUnfolderBase]: 22/286 cut-off events. [2025-02-06 09:25:34,570 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:25:34,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 286 events. 22/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1031 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 179. Up to 4 conditions per place. [2025-02-06 09:25:34,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 218 transitions, 443 flow [2025-02-06 09:25:34,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 218 transitions, 443 flow [2025-02-06 09:25:34,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:34,605 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;@48672aee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:34,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:25:34,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:34,622 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-02-06 09:25:34,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:34,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:34,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:34,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:34,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -481201533, now seen corresponding path program 1 times [2025-02-06 09:25:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828719553] [2025-02-06 09:25:34,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:34,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:25:34,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:25:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:34,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:34,838 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:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828719553] [2025-02-06 09:25:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828719553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654456948] [2025-02-06 09:25:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:34,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:34,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-02-06 09:25:34,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 218 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:34,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:34,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-02-06 09:25:34,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:35,113 INFO L124 PetriNetUnfolderBase]: 121/1127 cut-off events. [2025-02-06 09:25:35,113 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:25:35,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1127 events. 121/1127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7683 event pairs, 0 based on Foata normal form. 182/1201 useless extension candidates. Maximal degree in co-relation 1311. Up to 254 conditions per place. [2025-02-06 09:25:35,122 INFO L140 encePairwiseOnDemand]: 199/218 looper letters, 36 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-06 09:25:35,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 212 transitions, 507 flow [2025-02-06 09:25:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-02-06 09:25:35,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051987767584098 [2025-02-06 09:25:35,132 INFO L175 Difference]: Start difference. First operand has 203 places, 218 transitions, 443 flow. Second operand 3 states and 592 transitions. [2025-02-06 09:25:35,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 212 transitions, 507 flow [2025-02-06 09:25:35,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 212 transitions, 507 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:35,139 INFO L231 Difference]: Finished difference. Result has 204 places, 200 transitions, 415 flow [2025-02-06 09:25:35,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=204, PETRI_TRANSITIONS=200} [2025-02-06 09:25:35,142 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 1 predicate places. [2025-02-06 09:25:35,143 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 200 transitions, 415 flow [2025-02-06 09:25:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:35,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:35,143 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:35,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:25:35,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2120398841, now seen corresponding path program 1 times [2025-02-06 09:25:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341664815] [2025-02-06 09:25:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:35,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:35,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:35,621 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:35,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341664815] [2025-02-06 09:25:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341664815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469607928] [2025-02-06 09:25:35,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:35,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:35,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 218 [2025-02-06 09:25:35,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 200 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:35,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:35,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 218 [2025-02-06 09:25:35,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:35,968 INFO L124 PetriNetUnfolderBase]: 244/1422 cut-off events. [2025-02-06 09:25:35,968 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 09:25:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 1422 events. 244/1422 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 10673 event pairs, 166 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1891. Up to 387 conditions per place. [2025-02-06 09:25:35,974 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 80 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2025-02-06 09:25:35,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 247 transitions, 679 flow [2025-02-06 09:25:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1064 transitions. [2025-02-06 09:25:35,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8134556574923547 [2025-02-06 09:25:35,977 INFO L175 Difference]: Start difference. First operand has 204 places, 200 transitions, 415 flow. Second operand 6 states and 1064 transitions. [2025-02-06 09:25:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 247 transitions, 679 flow [2025-02-06 09:25:35,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 247 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:35,980 INFO L231 Difference]: Finished difference. Result has 206 places, 199 transitions, 419 flow [2025-02-06 09:25:35,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=206, PETRI_TRANSITIONS=199} [2025-02-06 09:25:35,981 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 3 predicate places. [2025-02-06 09:25:35,981 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 199 transitions, 419 flow [2025-02-06 09:25:35,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:35,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:35,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:35,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:25:35,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:35,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:35,982 INFO L85 PathProgramCache]: Analyzing trace with hash 330499753, now seen corresponding path program 1 times [2025-02-06 09:25:35,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:35,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402710507] [2025-02-06 09:25:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:35,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:35,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:36,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:36,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:36,024 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:36,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:36,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402710507] [2025-02-06 09:25:36,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402710507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100973222] [2025-02-06 09:25:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:36,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:36,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:36,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 218 [2025-02-06 09:25:36,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 199 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:36,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:36,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 218 [2025-02-06 09:25:36,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:36,190 INFO L124 PetriNetUnfolderBase]: 169/1629 cut-off events. [2025-02-06 09:25:36,191 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:25:36,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 1629 events. 169/1629 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12757 event pairs, 48 based on Foata normal form. 0/1469 useless extension candidates. Maximal degree in co-relation 1947. Up to 189 conditions per place. [2025-02-06 09:25:36,197 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 41 selfloop transitions, 3 changer transitions 0/219 dead transitions. [2025-02-06 09:25:36,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 219 transitions, 550 flow [2025-02-06 09:25:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-02-06 09:25:36,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8807339449541285 [2025-02-06 09:25:36,199 INFO L175 Difference]: Start difference. First operand has 206 places, 199 transitions, 419 flow. Second operand 3 states and 576 transitions. [2025-02-06 09:25:36,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 219 transitions, 550 flow [2025-02-06 09:25:36,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 219 transitions, 540 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:36,202 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 431 flow [2025-02-06 09:25:36,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2025-02-06 09:25:36,203 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, 2 predicate places. [2025-02-06 09:25:36,203 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 431 flow [2025-02-06 09:25:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:36,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:36,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:36,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:25:36,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:36,205 INFO L85 PathProgramCache]: Analyzing trace with hash -885290609, now seen corresponding path program 1 times [2025-02-06 09:25:36,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:36,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058584574] [2025-02-06 09:25:36,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:36,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:36,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:25:36,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:25:36,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:36,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:36,273 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:36,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:36,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058584574] [2025-02-06 09:25:36,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058584574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:36,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:36,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469010654] [2025-02-06 09:25:36,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:36,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:36,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:36,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:36,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 218 [2025-02-06 09:25:36,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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:36,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:36,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 218 [2025-02-06 09:25:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:36,378 INFO L124 PetriNetUnfolderBase]: 39/394 cut-off events. [2025-02-06 09:25:36,378 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:25:36,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 394 events. 39/394 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1466 event pairs, 0 based on Foata normal form. 13/380 useless extension candidates. Maximal degree in co-relation 454. Up to 25 conditions per place. [2025-02-06 09:25:36,380 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 50 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2025-02-06 09:25:36,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 179 transitions, 478 flow [2025-02-06 09:25:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1093 transitions. [2025-02-06 09:25:36,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8356269113149847 [2025-02-06 09:25:36,385 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 431 flow. Second operand 6 states and 1093 transitions. [2025-02-06 09:25:36,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 179 transitions, 478 flow [2025-02-06 09:25:36,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 179 transitions, 471 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 09:25:36,389 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 299 flow [2025-02-06 09:25:36,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2025-02-06 09:25:36,390 INFO L279 CegarLoopForPetriNet]: 203 programPoint places, -52 predicate places. [2025-02-06 09:25:36,390 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 299 flow [2025-02-06 09:25:36,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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:36,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:36,391 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:36,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:25:36,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:25:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -732186472, now seen corresponding path program 1 times [2025-02-06 09:25:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189374802] [2025-02-06 09:25:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:36,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:25:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:25:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:36,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:25:36,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:25:36,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:25:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:25:36,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:25:36,447 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:25:36,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-06 09:25:36,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-06 09:25:36,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-06 09:25:36,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-06 09:25:36,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-06 09:25:36,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-06 09:25:36,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-06 09:25:36,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-06 09:25:36,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-06 09:25:36,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-06 09:25:36,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-06 09:25:36,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:25:36,453 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:25:36,456 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:25:36,456 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:25:36,504 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:25:36,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 328 transitions, 672 flow [2025-02-06 09:25:36,564 INFO L124 PetriNetUnfolderBase]: 41/491 cut-off events. [2025-02-06 09:25:36,564 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:25:36,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 491 events. 41/491 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2163 event pairs, 0 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 308. Up to 6 conditions per place. [2025-02-06 09:25:36,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 328 transitions, 672 flow [2025-02-06 09:25:36,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 328 transitions, 672 flow [2025-02-06 09:25:36,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:25:36,575 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;@48672aee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:25:36,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-02-06 09:25:36,581 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:25:36,581 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-02-06 09:25:36,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:25:36,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:36,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:36,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -269991989, now seen corresponding path program 1 times [2025-02-06 09:25:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804707899] [2025-02-06 09:25:36,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:36,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 09:25:36,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 09:25:36,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:36,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:36,629 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:36,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804707899] [2025-02-06 09:25:36,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804707899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:36,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:36,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:25:36,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723629692] [2025-02-06 09:25:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:36,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:36,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:36,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:36,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:36,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 328 [2025-02-06 09:25:36,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 328 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:36,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 328 [2025-02-06 09:25:36,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:38,173 INFO L124 PetriNetUnfolderBase]: 3473/17174 cut-off events. [2025-02-06 09:25:38,174 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-06 09:25:38,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22725 conditions, 17174 events. 3473/17174 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 213401 event pairs, 3267 based on Foata normal form. 4175/19636 useless extension candidates. Maximal degree in co-relation 19472. Up to 5465 conditions per place. [2025-02-06 09:25:38,274 INFO L140 encePairwiseOnDemand]: 297/328 looper letters, 51 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-02-06 09:25:38,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 311 transitions, 744 flow [2025-02-06 09:25:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2025-02-06 09:25:38,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8851626016260162 [2025-02-06 09:25:38,276 INFO L175 Difference]: Start difference. First operand has 301 places, 328 transitions, 672 flow. Second operand 3 states and 871 transitions. [2025-02-06 09:25:38,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 311 transitions, 744 flow [2025-02-06 09:25:38,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 311 transitions, 744 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:25:38,287 INFO L231 Difference]: Finished difference. Result has 302 places, 299 transitions, 624 flow [2025-02-06 09:25:38,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=302, PETRI_TRANSITIONS=299} [2025-02-06 09:25:38,289 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 1 predicate places. [2025-02-06 09:25:38,289 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 299 transitions, 624 flow [2025-02-06 09:25:38,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:38,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:38,290 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:38,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:25:38,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:38,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1011479473, now seen corresponding path program 1 times [2025-02-06 09:25:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:38,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114570255] [2025-02-06 09:25:38,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:38,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:25:38,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:25:38,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:38,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:38,568 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:38,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:38,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114570255] [2025-02-06 09:25:38,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114570255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:38,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:38,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599379335] [2025-02-06 09:25:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:38,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:25:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:38,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:25:38,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:25:38,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 328 [2025-02-06 09:25:38,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 299 transitions, 624 flow. Second operand has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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:38,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:38,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 328 [2025-02-06 09:25:38,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:41,110 INFO L124 PetriNetUnfolderBase]: 6960/28835 cut-off events. [2025-02-06 09:25:41,110 INFO L125 PetriNetUnfolderBase]: For 345/384 co-relation queries the response was YES. [2025-02-06 09:25:41,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39821 conditions, 28835 events. 6960/28835 cut-off events. For 345/384 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 380403 event pairs, 3202 based on Foata normal form. 0/25918 useless extension candidates. Maximal degree in co-relation 36591. Up to 7816 conditions per place. [2025-02-06 09:25:41,273 INFO L140 encePairwiseOnDemand]: 322/328 looper letters, 142 selfloop transitions, 6 changer transitions 0/394 dead transitions. [2025-02-06 09:25:41,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 394 transitions, 1110 flow [2025-02-06 09:25:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-02-06 09:25:41,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8282520325203252 [2025-02-06 09:25:41,277 INFO L175 Difference]: Start difference. First operand has 302 places, 299 transitions, 624 flow. Second operand 6 states and 1630 transitions. [2025-02-06 09:25:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 394 transitions, 1110 flow [2025-02-06 09:25:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 394 transitions, 1108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:25:41,282 INFO L231 Difference]: Finished difference. Result has 305 places, 298 transitions, 632 flow [2025-02-06 09:25:41,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=305, PETRI_TRANSITIONS=298} [2025-02-06 09:25:41,282 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 4 predicate places. [2025-02-06 09:25:41,283 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 298 transitions, 632 flow [2025-02-06 09:25:41,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.5) internal successors, (1491), 6 states have internal predecessors, (1491), 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:41,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:41,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:25:41,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1094383851, now seen corresponding path program 1 times [2025-02-06 09:25:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:41,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684223274] [2025-02-06 09:25:41,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:25:41,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:25:41,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:41,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:41,317 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:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684223274] [2025-02-06 09:25:41,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684223274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672658385] [2025-02-06 09:25:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:41,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:41,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:41,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 328 [2025-02-06 09:25:41,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 298 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:41,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:41,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 328 [2025-02-06 09:25:41,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:43,532 INFO L124 PetriNetUnfolderBase]: 6242/31679 cut-off events. [2025-02-06 09:25:43,533 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-06 09:25:43,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41629 conditions, 31679 events. 6242/31679 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 438679 event pairs, 1648 based on Foata normal form. 0/28312 useless extension candidates. Maximal degree in co-relation 39505. Up to 5556 conditions per place. [2025-02-06 09:25:43,749 INFO L140 encePairwiseOnDemand]: 321/328 looper letters, 74 selfloop transitions, 5 changer transitions 0/336 dead transitions. [2025-02-06 09:25:43,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 336 transitions, 877 flow [2025-02-06 09:25:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-06 09:25:43,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8689024390243902 [2025-02-06 09:25:43,751 INFO L175 Difference]: Start difference. First operand has 305 places, 298 transitions, 632 flow. Second operand 3 states and 855 transitions. [2025-02-06 09:25:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 336 transitions, 877 flow [2025-02-06 09:25:43,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 336 transitions, 865 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:25:43,758 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 664 flow [2025-02-06 09:25:43,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2025-02-06 09:25:43,764 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 3 predicate places. [2025-02-06 09:25:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 664 flow [2025-02-06 09:25:43,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:43,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:25:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:25:43,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash 106765291, now seen corresponding path program 1 times [2025-02-06 09:25:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689299766] [2025-02-06 09:25:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:25:43,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:25:43,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:43,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:43,823 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,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689299766] [2025-02-06 09:25:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689299766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:25:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584797841] [2025-02-06 09:25:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:43,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:25:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:43,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:25:43,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:25:43,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 328 [2025-02-06 09:25:43,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 664 flow. Second operand has 5 states, 5 states have (on average 258.8) internal successors, (1294), 5 states have internal predecessors, (1294), 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,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:43,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 328 [2025-02-06 09:25:43,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:47,041 INFO L124 PetriNetUnfolderBase]: 7128/38369 cut-off events. [2025-02-06 09:25:47,042 INFO L125 PetriNetUnfolderBase]: For 573/581 co-relation queries the response was YES. [2025-02-06 09:25:47,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50681 conditions, 38369 events. 7128/38369 cut-off events. For 573/581 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 557005 event pairs, 3498 based on Foata normal form. 13/34381 useless extension candidates. Maximal degree in co-relation 46285. Up to 10379 conditions per place. [2025-02-06 09:25:47,184 INFO L140 encePairwiseOnDemand]: 323/328 looper letters, 100 selfloop transitions, 5 changer transitions 0/365 dead transitions. [2025-02-06 09:25:47,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 365 transitions, 998 flow [2025-02-06 09:25:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:25:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:25:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1648 transitions. [2025-02-06 09:25:47,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8373983739837398 [2025-02-06 09:25:47,187 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 664 flow. Second operand 6 states and 1648 transitions. [2025-02-06 09:25:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 365 transitions, 998 flow [2025-02-06 09:25:47,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 365 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:47,193 INFO L231 Difference]: Finished difference. Result has 310 places, 305 transitions, 680 flow [2025-02-06 09:25:47,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=680, PETRI_PLACES=310, PETRI_TRANSITIONS=305} [2025-02-06 09:25:47,193 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 9 predicate places. [2025-02-06 09:25:47,194 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 305 transitions, 680 flow [2025-02-06 09:25:47,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 258.8) internal successors, (1294), 5 states have internal predecessors, (1294), 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,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:47,194 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] [2025-02-06 09:25:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:25:47,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 82235241, now seen corresponding path program 1 times [2025-02-06 09:25:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817674673] [2025-02-06 09:25:47,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:47,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:25:47,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:25:47,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:47,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:47,229 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,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817674673] [2025-02-06 09:25:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817674673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950023094] [2025-02-06 09:25:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:47,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:47,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:47,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:47,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:47,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 328 [2025-02-06 09:25:47,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 305 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:47,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:47,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 328 [2025-02-06 09:25:47,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:25:57,299 INFO L124 PetriNetUnfolderBase]: 36146/135604 cut-off events. [2025-02-06 09:25:57,300 INFO L125 PetriNetUnfolderBase]: For 887/887 co-relation queries the response was YES. [2025-02-06 09:25:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194158 conditions, 135604 events. 36146/135604 cut-off events. For 887/887 co-relation queries the response was YES. Maximal size of possible extension queue 3207. Compared 2158875 event pairs, 14775 based on Foata normal form. 0/121770 useless extension candidates. Maximal degree in co-relation 193838. Up to 31067 conditions per place. [2025-02-06 09:25:58,073 INFO L140 encePairwiseOnDemand]: 293/328 looper letters, 102 selfloop transitions, 26 changer transitions 0/364 dead transitions. [2025-02-06 09:25:58,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 364 transitions, 1065 flow [2025-02-06 09:25:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:25:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:25:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2025-02-06 09:25:58,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404471544715447 [2025-02-06 09:25:58,076 INFO L175 Difference]: Start difference. First operand has 310 places, 305 transitions, 680 flow. Second operand 3 states and 827 transitions. [2025-02-06 09:25:58,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 364 transitions, 1065 flow [2025-02-06 09:25:58,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 364 transitions, 1059 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:25:58,083 INFO L231 Difference]: Finished difference. Result has 312 places, 331 transitions, 900 flow [2025-02-06 09:25:58,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=312, PETRI_TRANSITIONS=331} [2025-02-06 09:25:58,084 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 11 predicate places. [2025-02-06 09:25:58,084 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 331 transitions, 900 flow [2025-02-06 09:25:58,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:25:58,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:25:58,084 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:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:25:58,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:25:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:25:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 974009371, now seen corresponding path program 1 times [2025-02-06 09:25:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:25:58,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204734903] [2025-02-06 09:25:58,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:25:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:25:58,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 09:25:58,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 09:25:58,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:25:58,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:25:58,149 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:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:25:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204734903] [2025-02-06 09:25:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204734903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:25:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:25:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:25:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63743863] [2025-02-06 09:25:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:25:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:25:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:25:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:25:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:25:58,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 328 [2025-02-06 09:25:58,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 331 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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:58,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:25:58,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 328 [2025-02-06 09:25:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:10,389 INFO L124 PetriNetUnfolderBase]: 33818/146980 cut-off events. [2025-02-06 09:26:10,390 INFO L125 PetriNetUnfolderBase]: For 34635/35981 co-relation queries the response was YES. [2025-02-06 09:26:10,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234476 conditions, 146980 events. 33818/146980 cut-off events. For 34635/35981 co-relation queries the response was YES. Maximal size of possible extension queue 3419. Compared 2458124 event pairs, 23363 based on Foata normal form. 194/134368 useless extension candidates. Maximal degree in co-relation 234131. Up to 47091 conditions per place. [2025-02-06 09:26:11,303 INFO L140 encePairwiseOnDemand]: 315/328 looper letters, 92 selfloop transitions, 22 changer transitions 0/371 dead transitions. [2025-02-06 09:26:11,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 371 transitions, 1270 flow [2025-02-06 09:26:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 815 transitions. [2025-02-06 09:26:11,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8282520325203252 [2025-02-06 09:26:11,305 INFO L175 Difference]: Start difference. First operand has 312 places, 331 transitions, 900 flow. Second operand 3 states and 815 transitions. [2025-02-06 09:26:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 371 transitions, 1270 flow [2025-02-06 09:26:11,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 371 transitions, 1200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:11,365 INFO L231 Difference]: Finished difference. Result has 314 places, 351 transitions, 1054 flow [2025-02-06 09:26:11,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=314, PETRI_TRANSITIONS=351} [2025-02-06 09:26:11,366 INFO L279 CegarLoopForPetriNet]: 301 programPoint places, 13 predicate places. [2025-02-06 09:26:11,366 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 351 transitions, 1054 flow [2025-02-06 09:26:11,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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:11,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:11,367 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:26:11,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-02-06 09:26:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1807751830, now seen corresponding path program 1 times [2025-02-06 09:26:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450363217] [2025-02-06 09:26:11,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:11,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:26:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:26:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:11,396 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:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450363217] [2025-02-06 09:26:11,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450363217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872501688] [2025-02-06 09:26:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:11,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:11,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:11,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 328 [2025-02-06 09:26:11,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 351 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 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:11,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:11,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 328 [2025-02-06 09:26:11,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand