./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:31,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:31,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:31,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:31,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:31,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:31,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:31,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:31,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:31,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:31,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:31,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:31,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:31,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:31,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:31,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:31,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:31,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:31,835 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2025-03-17 11:11:32,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:32,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:32,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:32,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:32,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:32,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-03-17 11:11:33,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f987fdc0/a8c54b2073044f1baf1b228a2de52876/FLAG1e8b2a242 [2025-03-17 11:11:33,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:33,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2025-03-17 11:11:33,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f987fdc0/a8c54b2073044f1baf1b228a2de52876/FLAG1e8b2a242 [2025-03-17 11:11:33,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f987fdc0/a8c54b2073044f1baf1b228a2de52876 [2025-03-17 11:11:33,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:33,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:33,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:33,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:33,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:33,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b21774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33, skipping insertion in model container [2025-03-17 11:11:33,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:33,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:33,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:33,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:33,719 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:33,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33 WrapperNode [2025-03-17 11:11:33,720 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:33,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:33,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:33,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:33,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,763 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2025-03-17 11:11:33,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:33,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:33,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:33,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:33,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:33,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:33,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:33,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:33,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (1/1) ... [2025-03-17 11:11:33,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:33,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:11:33,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:11:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:33,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:33,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:33,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:33,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:33,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:33,854 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:11:33,949 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:33,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:34,357 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:34,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:34,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:34,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:34,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:34 BoogieIcfgContainer [2025-03-17 11:11:34,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:34,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:34,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:34,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:34,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:33" (1/3) ... [2025-03-17 11:11:34,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256561e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:34, skipping insertion in model container [2025-03-17 11:11:34,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:33" (2/3) ... [2025-03-17 11:11:34,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3256561e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:34, skipping insertion in model container [2025-03-17 11:11:34,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:34" (3/3) ... [2025-03-17 11:11:34,386 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2025-03-17 11:11:34,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:34,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-subst.wvr.c that has 4 procedures, 392 locations, 1 initial locations, 0 loop locations, and 41 error locations. [2025-03-17 11:11:34,401 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:34,524 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:34,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2025-03-17 11:11:34,706 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2025-03-17 11:11:34,710 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:34,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 409 events. 21/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1092 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2025-03-17 11:11:34,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2025-03-17 11:11:34,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2025-03-17 11:11:34,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:34,748 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;@4b394880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:34,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-17 11:11:34,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:34,755 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-17 11:11:34,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:34,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:34,756 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] [2025-03-17 11:11:34,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -198152875, now seen corresponding path program 1 times [2025-03-17 11:11:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:34,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308875251] [2025-03-17 11:11:34,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:11:34,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:11:34,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:34,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308875251] [2025-03-17 11:11:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308875251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:34,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84631869] [2025-03-17 11:11:34,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:34,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:34,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:34,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:34,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:34,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-17 11:11:34,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-17 11:11:34,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,125 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2025-03-17 11:11:35,125 INFO L125 PetriNetUnfolderBase]: For 17/19 co-relation queries the response was YES. [2025-03-17 11:11:35,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3294 event pairs, 7 based on Foata normal form. 23/617 useless extension candidates. Maximal degree in co-relation 608. Up to 25 conditions per place. [2025-03-17 11:11:35,132 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2025-03-17 11:11:35,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2025-03-17 11:11:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-17 11:11:35,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-17 11:11:35,144 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2025-03-17 11:11:35,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2025-03-17 11:11:35,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:35,154 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2025-03-17 11:11:35,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-03-17 11:11:35,159 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2025-03-17 11:11:35,159 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2025-03-17 11:11:35,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:35,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:35,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -595496567, now seen corresponding path program 1 times [2025-03-17 11:11:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748911291] [2025-03-17 11:11:35,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:11:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:11:35,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748911291] [2025-03-17 11:11:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748911291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361088907] [2025-03-17 11:11:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-17 11:11:35,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-17 11:11:35,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,316 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2025-03-17 11:11:35,316 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:11:35,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 551 events. 25/551 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2194 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 547. Up to 22 conditions per place. [2025-03-17 11:11:35,341 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-03-17 11:11:35,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2025-03-17 11:11:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-17 11:11:35,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-17 11:11:35,346 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2025-03-17 11:11:35,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2025-03-17 11:11:35,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,355 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2025-03-17 11:11:35,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=379} [2025-03-17 11:11:35,356 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-03-17 11:11:35,356 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2025-03-17 11:11:35,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,357 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] [2025-03-17 11:11:35,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:35,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 12089159, now seen corresponding path program 1 times [2025-03-17 11:11:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488456164] [2025-03-17 11:11:35,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:11:35,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:11:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488456164] [2025-03-17 11:11:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488456164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488957145] [2025-03-17 11:11:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-17 11:11:35,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-17 11:11:35,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,537 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2025-03-17 11:11:35,537 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-17 11:11:35,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 470 events. 23/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1661 event pairs, 7 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 460. Up to 25 conditions per place. [2025-03-17 11:11:35,543 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-03-17 11:11:35,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2025-03-17 11:11:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-17 11:11:35,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-17 11:11:35,546 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2025-03-17 11:11:35,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2025-03-17 11:11:35,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,553 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2025-03-17 11:11:35,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2025-03-17 11:11:35,555 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2025-03-17 11:11:35,555 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2025-03-17 11:11:35,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:35,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:35,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2101389129, now seen corresponding path program 1 times [2025-03-17 11:11:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387939355] [2025-03-17 11:11:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:11:35,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:11:35,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387939355] [2025-03-17 11:11:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387939355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549490945] [2025-03-17 11:11:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-17 11:11:35,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-17 11:11:35,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,753 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2025-03-17 11:11:35,754 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:35,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 846 events. 43/846 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4599 event pairs, 7 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2025-03-17 11:11:35,766 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-17 11:11:35,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2025-03-17 11:11:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-17 11:11:35,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-17 11:11:35,770 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2025-03-17 11:11:35,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2025-03-17 11:11:35,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,775 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2025-03-17 11:11:35,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2025-03-17 11:11:35,776 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-03-17 11:11:35,777 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2025-03-17 11:11:35,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:35,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 418738452, now seen corresponding path program 1 times [2025-03-17 11:11:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-03-17 11:11:35,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:11:35,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:11:35,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116214797] [2025-03-17 11:11:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116214797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953344624] [2025-03-17 11:11:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:35,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-17 11:11:35,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:35,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-17 11:11:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:35,916 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2025-03-17 11:11:35,916 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:35,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 602 events. 32/602 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2755 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 583. Up to 29 conditions per place. [2025-03-17 11:11:35,924 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-17 11:11:35,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2025-03-17 11:11:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-03-17 11:11:35,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-03-17 11:11:35,926 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2025-03-17 11:11:35,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2025-03-17 11:11:35,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:35,930 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2025-03-17 11:11:35,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2025-03-17 11:11:35,931 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-03-17 11:11:35,931 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2025-03-17 11:11:35,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:35,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:35,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:35,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:35,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1421314752, now seen corresponding path program 1 times [2025-03-17 11:11:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425169016] [2025-03-17 11:11:35,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:35,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:11:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:11:35,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:35,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425169016] [2025-03-17 11:11:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425169016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:35,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722987338] [2025-03-17 11:11:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:35,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:35,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-03-17 11:11:36,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-03-17 11:11:36,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,116 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2025-03-17 11:11:36,116 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-17 11:11:36,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 64/971 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5232 event pairs, 20 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 963. Up to 50 conditions per place. [2025-03-17 11:11:36,126 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-17 11:11:36,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2025-03-17 11:11:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-03-17 11:11:36,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-03-17 11:11:36,128 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2025-03-17 11:11:36,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2025-03-17 11:11:36,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:36,132 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2025-03-17 11:11:36,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2025-03-17 11:11:36,133 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-03-17 11:11:36,133 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2025-03-17 11:11:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:36,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:36,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1894529296, now seen corresponding path program 1 times [2025-03-17 11:11:36,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-03-17 11:11:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 11:11:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 11:11:36,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018324244] [2025-03-17 11:11:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018324244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212595881] [2025-03-17 11:11:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2025-03-17 11:11:36,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2025-03-17 11:11:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,269 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2025-03-17 11:11:36,269 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-03-17 11:11:36,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 709 events. 35/709 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3515 event pairs, 7 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 670. Up to 25 conditions per place. [2025-03-17 11:11:36,278 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-17 11:11:36,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2025-03-17 11:11:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2025-03-17 11:11:36,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2025-03-17 11:11:36,281 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2025-03-17 11:11:36,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2025-03-17 11:11:36,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:36,286 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2025-03-17 11:11:36,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-03-17 11:11:36,288 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-03-17 11:11:36,288 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2025-03-17 11:11:36,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:36,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:36,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash 786192481, now seen corresponding path program 1 times [2025-03-17 11:11:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574455343] [2025-03-17 11:11:36,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 11:11:36,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 11:11:36,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574455343] [2025-03-17 11:11:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574455343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823636180] [2025-03-17 11:11:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-17 11:11:36,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-17 11:11:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,461 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2025-03-17 11:11:36,461 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:11:36,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 713 events. 36/713 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3695 event pairs, 8 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 670. Up to 29 conditions per place. [2025-03-17 11:11:36,471 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-17 11:11:36,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2025-03-17 11:11:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-03-17 11:11:36,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2025-03-17 11:11:36,475 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2025-03-17 11:11:36,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2025-03-17 11:11:36,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:36,481 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2025-03-17 11:11:36,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-03-17 11:11:36,482 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-03-17 11:11:36,483 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2025-03-17 11:11:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:36,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1780443218, now seen corresponding path program 1 times [2025-03-17 11:11:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-17 11:11:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 11:11:36,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 11:11:36,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-17 11:11:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465913524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894331538] [2025-03-17 11:11:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2025-03-17 11:11:36,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2025-03-17 11:11:36,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,638 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2025-03-17 11:11:36,638 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2025-03-17 11:11:36,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 40/564 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2621 event pairs, 20 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 532. Up to 50 conditions per place. [2025-03-17 11:11:36,648 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-17 11:11:36,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2025-03-17 11:11:36,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-03-17 11:11:36,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2025-03-17 11:11:36,651 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2025-03-17 11:11:36,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2025-03-17 11:11:36,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:36,657 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2025-03-17 11:11:36,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-03-17 11:11:36,658 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-17 11:11:36,658 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2025-03-17 11:11:36,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:36,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -923691189, now seen corresponding path program 1 times [2025-03-17 11:11:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 11:11:36,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:11:36,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:11:36,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-17 11:11:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778307090] [2025-03-17 11:11:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:36,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:36,854 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2025-03-17 11:11:36,854 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:36,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1238 events. 76/1238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8582 event pairs, 13 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1202. Up to 43 conditions per place. [2025-03-17 11:11:36,865 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-17 11:11:36,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2025-03-17 11:11:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:36,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-03-17 11:11:36,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-03-17 11:11:36,867 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2025-03-17 11:11:36,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2025-03-17 11:11:36,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:36,872 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2025-03-17 11:11:36,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-03-17 11:11:36,873 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:36,874 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2025-03-17 11:11:36,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:36,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:36,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:36,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 172041489, now seen corresponding path program 1 times [2025-03-17 11:11:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520843983] [2025-03-17 11:11:36,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:36,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 11:11:36,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 11:11:36,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520843983] [2025-03-17 11:11:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520843983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:36,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632693049] [2025-03-17 11:11:36,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:36,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:36,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:36,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:36,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-17 11:11:36,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:36,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:36,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-17 11:11:36,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,039 INFO L124 PetriNetUnfolderBase]: 69/1058 cut-off events. [2025-03-17 11:11:37,039 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 1058 events. 69/1058 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6750 event pairs, 10 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 942. Up to 49 conditions per place. [2025-03-17 11:11:37,048 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2025-03-17 11:11:37,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2025-03-17 11:11:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-17 11:11:37,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-03-17 11:11:37,050 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2025-03-17 11:11:37,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2025-03-17 11:11:37,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:37,054 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2025-03-17 11:11:37,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2025-03-17 11:11:37,055 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:37,055 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2025-03-17 11:11:37,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:37,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1392811156, now seen corresponding path program 1 times [2025-03-17 11:11:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-17 11:11:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 11:11:37,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 11:11:37,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-17 11:11:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908744898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-17 11:11:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:37,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,262 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2025-03-17 11:11:37,262 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-03-17 11:11:37,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1296 events. 70/1296 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9276 event pairs, 4 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 1117. Up to 53 conditions per place. [2025-03-17 11:11:37,275 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-17 11:11:37,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2025-03-17 11:11:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-17 11:11:37,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-17 11:11:37,277 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2025-03-17 11:11:37,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2025-03-17 11:11:37,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:37,283 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2025-03-17 11:11:37,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2025-03-17 11:11:37,284 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-17 11:11:37,284 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2025-03-17 11:11:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:37,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:37,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 67236919, now seen corresponding path program 1 times [2025-03-17 11:11:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-17 11:11:37,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:11:37,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:11:37,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:37,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211621101] [2025-03-17 11:11:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211621101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129623805] [2025-03-17 11:11:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2025-03-17 11:11:37,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2025-03-17 11:11:37,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,467 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2025-03-17 11:11:37,467 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:11:37,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 1056 events. 57/1056 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6813 event pairs, 8 based on Foata normal form. 0/907 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2025-03-17 11:11:37,474 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-17 11:11:37,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2025-03-17 11:11:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2025-03-17 11:11:37,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2025-03-17 11:11:37,477 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2025-03-17 11:11:37,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2025-03-17 11:11:37,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:37,481 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2025-03-17 11:11:37,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=367, PETRI_TRANSITIONS=371} [2025-03-17 11:11:37,482 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2025-03-17 11:11:37,482 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2025-03-17 11:11:37,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:37,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:37,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:37,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1323815542, now seen corresponding path program 1 times [2025-03-17 11:11:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-17 11:11:37,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:11:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:11:37,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011927379] [2025-03-17 11:11:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011927379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486502551] [2025-03-17 11:11:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-03-17 11:11:37,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 371 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-03-17 11:11:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:37,779 INFO L124 PetriNetUnfolderBase]: 313/2888 cut-off events. [2025-03-17 11:11:37,779 INFO L125 PetriNetUnfolderBase]: For 67/157 co-relation queries the response was YES. [2025-03-17 11:11:37,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 2888 events. 313/2888 cut-off events. For 67/157 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 26670 event pairs, 96 based on Foata normal form. 1/2462 useless extension candidates. Maximal degree in co-relation 2700. Up to 322 conditions per place. [2025-03-17 11:11:37,797 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2025-03-17 11:11:37,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 835 flow [2025-03-17 11:11:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2025-03-17 11:11:37,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2025-03-17 11:11:37,800 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1177 transitions. [2025-03-17 11:11:37,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 835 flow [2025-03-17 11:11:37,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:37,803 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 803 flow [2025-03-17 11:11:37,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-03-17 11:11:37,804 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-17 11:11:37,804 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 803 flow [2025-03-17 11:11:37,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:37,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:37,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:37,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash -441091812, now seen corresponding path program 1 times [2025-03-17 11:11:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-03-17 11:11:37,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:37,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 11:11:37,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 11:11:37,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:37,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:37,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199391489] [2025-03-17 11:11:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199391489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:37,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:37,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001300950] [2025-03-17 11:11:37,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:37,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:37,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:37,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:37,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:37,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2025-03-17 11:11:37,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:37,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:37,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2025-03-17 11:11:37,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:38,133 INFO L124 PetriNetUnfolderBase]: 167/2950 cut-off events. [2025-03-17 11:11:38,134 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2025-03-17 11:11:38,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2950 events. 167/2950 cut-off events. For 23/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 27779 event pairs, 20 based on Foata normal form. 1/2540 useless extension candidates. Maximal degree in co-relation 2794. Up to 133 conditions per place. [2025-03-17 11:11:38,153 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2025-03-17 11:11:38,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 860 flow [2025-03-17 11:11:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-17 11:11:38,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-17 11:11:38,156 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 803 flow. Second operand 3 states and 1185 transitions. [2025-03-17 11:11:38,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 376 transitions, 860 flow [2025-03-17 11:11:38,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:38,161 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2025-03-17 11:11:38,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2025-03-17 11:11:38,162 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-17 11:11:38,162 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2025-03-17 11:11:38,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:38,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:38,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:38,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:11:38,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:38,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2034573824, now seen corresponding path program 1 times [2025-03-17 11:11:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:38,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121927009] [2025-03-17 11:11:38,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:38,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 11:11:38,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 11:11:38,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:38,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121927009] [2025-03-17 11:11:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121927009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646033005] [2025-03-17 11:11:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:38,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:38,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:38,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:38,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:38,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:38,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:38,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:38,557 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2025-03-17 11:11:38,557 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2025-03-17 11:11:38,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2582 events. 114/2582 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 23001 event pairs, 4 based on Foata normal form. 0/2259 useless extension candidates. Maximal degree in co-relation 2341. Up to 68 conditions per place. [2025-03-17 11:11:38,588 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-17 11:11:38,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2025-03-17 11:11:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-17 11:11:38,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-17 11:11:38,590 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2025-03-17 11:11:38,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2025-03-17 11:11:38,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:38,595 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2025-03-17 11:11:38,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2025-03-17 11:11:38,596 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:38,596 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2025-03-17 11:11:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:38,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:38,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:38,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:38,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1050076064, now seen corresponding path program 1 times [2025-03-17 11:11:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-03-17 11:11:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:38,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:11:38,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:11:38,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:38,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:38,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-03-17 11:11:38,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019922530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:38,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948882827] [2025-03-17 11:11:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:38,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:38,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:38,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:38,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:38,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:38,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:38,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:38,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:38,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([916] L50-8-->L50-7: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet12#1][168], [437#(= |#race~is_null_3~0| 0), 72#thread3ENTRYtrue, Black: 446#true, 8#L50-7true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 45#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:38,988 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-17 11:11:38,988 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-17 11:11:38,988 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2025-03-17 11:11:38,988 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-17 11:11:39,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] thread1EXIT-->L79: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), 72#thread3ENTRYtrue, Black: 446#true, 8#L50-7true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 45#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,064 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-03-17 11:11:39,064 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-03-17 11:11:39,064 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2025-03-17 11:11:39,064 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2025-03-17 11:11:39,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] thread1EXIT-->L79: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), 72#thread3ENTRYtrue, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 431#true, 334#L50-5true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 45#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,065 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-17 11:11:39,065 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-17 11:11:39,065 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-17 11:11:39,065 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2025-03-17 11:11:39,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] thread1EXIT-->L79: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), 139#L50-6true, 72#thread3ENTRYtrue, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 431#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 45#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,069 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-17 11:11:39,069 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-17 11:11:39,069 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-17 11:11:39,069 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-03-17 11:11:39,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1066] thread1EXIT-->L79: Formula: (and (= 0 v_thread1Thread1of1ForFork2_thidvar1_4) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork2_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_4, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), 72#thread3ENTRYtrue, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 22#L52true, Black: 439#true, 45#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,087 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-17 11:11:39,087 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-17 11:11:39,087 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2025-03-17 11:11:39,087 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-17 11:11:39,111 INFO L124 PetriNetUnfolderBase]: 227/3804 cut-off events. [2025-03-17 11:11:39,112 INFO L125 PetriNetUnfolderBase]: For 44/113 co-relation queries the response was YES. [2025-03-17 11:11:39,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3804 events. 227/3804 cut-off events. For 44/113 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 36973 event pairs, 28 based on Foata normal form. 1/3299 useless extension candidates. Maximal degree in co-relation 3487. Up to 120 conditions per place. [2025-03-17 11:11:39,132 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2025-03-17 11:11:39,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 372 transitions, 860 flow [2025-03-17 11:11:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-17 11:11:39,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-17 11:11:39,135 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2025-03-17 11:11:39,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 372 transitions, 860 flow [2025-03-17 11:11:39,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:39,139 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 830 flow [2025-03-17 11:11:39,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2025-03-17 11:11:39,140 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-17 11:11:39,140 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 830 flow [2025-03-17 11:11:39,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:39,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:39,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:39,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:39,141 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1015351906, now seen corresponding path program 1 times [2025-03-17 11:11:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-17 11:11:39,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:39,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:11:39,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:11:39,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:39,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766907485] [2025-03-17 11:11:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766907485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557536075] [2025-03-17 11:11:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:39,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:39,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:39,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:39,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:39,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:39,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:39,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:39,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:39,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 184#L56-26true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,504 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-17 11:11:39,504 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-17 11:11:39,504 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-17 11:11:39,504 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2025-03-17 11:11:39,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 32#L56-27true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,507 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-17 11:11:39,507 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-17 11:11:39,507 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2025-03-17 11:11:39,507 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-17 11:11:39,519 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 184#L56-26true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,519 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2025-03-17 11:11:39,519 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2025-03-17 11:11:39,519 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-03-17 11:11:39,519 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2025-03-17 11:11:39,519 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2025-03-17 11:11:39,520 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 32#L56-27true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:39,520 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2025-03-17 11:11:39,520 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-03-17 11:11:39,520 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2025-03-17 11:11:39,520 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2025-03-17 11:11:39,520 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2025-03-17 11:11:39,534 INFO L124 PetriNetUnfolderBase]: 126/3370 cut-off events. [2025-03-17 11:11:39,534 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2025-03-17 11:11:39,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 3370 events. 126/3370 cut-off events. For 43/80 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30709 event pairs, 14 based on Foata normal form. 2/3002 useless extension candidates. Maximal degree in co-relation 3242. Up to 140 conditions per place. [2025-03-17 11:11:39,557 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-17 11:11:39,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 375 transitions, 881 flow [2025-03-17 11:11:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2025-03-17 11:11:39,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2025-03-17 11:11:39,559 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 830 flow. Second operand 3 states and 1190 transitions. [2025-03-17 11:11:39,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 375 transitions, 881 flow [2025-03-17 11:11:39,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:39,562 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 836 flow [2025-03-17 11:11:39,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-03-17 11:11:39,563 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:39,563 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 836 flow [2025-03-17 11:11:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:39,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:39,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:39,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:11:39,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:39,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash -37849309, now seen corresponding path program 1 times [2025-03-17 11:11:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:39,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-17 11:11:39,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:39,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 11:11:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 11:11:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66746341] [2025-03-17 11:11:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66746341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339174076] [2025-03-17 11:11:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:39,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:39,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:39,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:39,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2025-03-17 11:11:39,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:39,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:39,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2025-03-17 11:11:39,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:40,403 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2025-03-17 11:11:40,404 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2025-03-17 11:11:40,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 7770 events. 456/7770 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 92372 event pairs, 76 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 7734. Up to 616 conditions per place. [2025-03-17 11:11:40,491 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2025-03-17 11:11:40,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 374 transitions, 894 flow [2025-03-17 11:11:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2025-03-17 11:11:40,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2025-03-17 11:11:40,495 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 836 flow. Second operand 3 states and 1179 transitions. [2025-03-17 11:11:40,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 374 transitions, 894 flow [2025-03-17 11:11:40,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:40,501 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2025-03-17 11:11:40,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2025-03-17 11:11:40,502 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-17 11:11:40,502 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2025-03-17 11:11:40,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:40,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:40,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:40,503 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1760142603, now seen corresponding path program 1 times [2025-03-17 11:11:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:40,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-17 11:11:40,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:40,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:40,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235400272] [2025-03-17 11:11:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235400272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:40,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:40,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381080] [2025-03-17 11:11:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:40,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:40,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:40,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:40,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:40,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:40,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:40,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:40,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:41,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1064] thread3EXIT-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 352#L82-6true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,122 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2025-03-17 11:11:41,122 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-17 11:11:41,122 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2025-03-17 11:11:41,122 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2025-03-17 11:11:41,179 INFO L124 PetriNetUnfolderBase]: 240/5926 cut-off events. [2025-03-17 11:11:41,179 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2025-03-17 11:11:41,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6606 conditions, 5926 events. 240/5926 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 64200 event pairs, 20 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 5808. Up to 300 conditions per place. [2025-03-17 11:11:41,226 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-03-17 11:11:41,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 902 flow [2025-03-17 11:11:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-03-17 11:11:41,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-03-17 11:11:41,228 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1189 transitions. [2025-03-17 11:11:41,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 902 flow [2025-03-17 11:11:41,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 902 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:41,232 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 866 flow [2025-03-17 11:11:41,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-03-17 11:11:41,233 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:41,233 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 866 flow [2025-03-17 11:11:41,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:41,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:41,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:41,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:41,234 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:41,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash 92523122, now seen corresponding path program 1 times [2025-03-17 11:11:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:41,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-03-17 11:11:41,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:41,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:41,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332857584] [2025-03-17 11:11:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332857584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:41,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:41,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225114586] [2025-03-17 11:11:41,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:41,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:41,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:41,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:41,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:41,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:41,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:41,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:41,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:41,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([996] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][227], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 473#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,579 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-17 11:11:41,579 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-17 11:11:41,579 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-17 11:11:41,579 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-17 11:11:41,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([996] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][227], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,694 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,694 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,694 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,694 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,699 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,699 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,699 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,699 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([996] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][227], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,700 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([996] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][227], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, Black: 469#true, 471#(= |#race~filename_7~0| 0), 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,700 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([996] L56-8-->L56-7: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][227], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,700 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,700 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-17 11:11:41,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, 475#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,702 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-17 11:11:41,702 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:41,702 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:41,702 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:41,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 108#L56-6true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, 475#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,703 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2025-03-17 11:11:41,703 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-17 11:11:41,703 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-17 11:11:41,703 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-17 11:11:41,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 44#L58true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,706 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-17 11:11:41,706 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 39#L56-7true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,707 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is not cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2025-03-17 11:11:41,707 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, 475#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,707 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:41,707 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:41,708 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][344], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 108#L56-6true, Black: 461#true, Black: 431#true, Black: 465#true, 475#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,708 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-17 11:11:41,708 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-17 11:11:41,708 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-17 11:11:41,708 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-17 11:11:41,708 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-17 11:11:41,709 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][303], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 44#L58true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:41,709 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is not cut-off event [2025-03-17 11:11:41,709 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-17 11:11:41,709 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-17 11:11:41,709 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-17 11:11:41,709 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2025-03-17 11:11:41,710 INFO L124 PetriNetUnfolderBase]: 395/4651 cut-off events. [2025-03-17 11:11:41,710 INFO L125 PetriNetUnfolderBase]: For 256/393 co-relation queries the response was YES. [2025-03-17 11:11:41,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 4651 events. 395/4651 cut-off events. For 256/393 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 49952 event pairs, 96 based on Foata normal form. 2/4288 useless extension candidates. Maximal degree in co-relation 5276. Up to 471 conditions per place. [2025-03-17 11:11:41,739 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-03-17 11:11:41,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 898 flow [2025-03-17 11:11:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2025-03-17 11:11:41,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2025-03-17 11:11:41,741 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 866 flow. Second operand 3 states and 1185 transitions. [2025-03-17 11:11:41,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 898 flow [2025-03-17 11:11:41,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 371 transitions, 898 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:41,745 INFO L231 Difference]: Finished difference. Result has 366 places, 369 transitions, 868 flow [2025-03-17 11:11:41,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=366, PETRI_TRANSITIONS=369} [2025-03-17 11:11:41,746 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2025-03-17 11:11:41,746 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 369 transitions, 868 flow [2025-03-17 11:11:41,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:41,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:41,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:41,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:11:41,747 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2046941143, now seen corresponding path program 1 times [2025-03-17 11:11:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-17 11:11:41,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:41,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:11:41,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:11:41,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:41,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294941690] [2025-03-17 11:11:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294941690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667406459] [2025-03-17 11:11:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:41,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2025-03-17 11:11:41,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 369 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:41,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:41,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2025-03-17 11:11:41,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:42,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1064] thread3EXIT-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 352#L82-6true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:42,417 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-17 11:11:42,417 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-17 11:11:42,417 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-17 11:11:42,417 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-17 11:11:42,420 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1064] thread3EXIT-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 352#L82-6true, 467#(= 0 |#race~filename_is_null_8~0|), 473#true, Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|), 476#true]) [2025-03-17 11:11:42,420 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-17 11:11:42,420 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-17 11:11:42,420 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-17 11:11:42,420 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-17 11:11:42,420 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-17 11:11:42,421 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2025-03-17 11:11:42,421 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2025-03-17 11:11:42,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 5368 events. 193/5368 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 56553 event pairs, 6 based on Foata normal form. 0/5015 useless extension candidates. Maximal degree in co-relation 5679. Up to 147 conditions per place. [2025-03-17 11:11:42,445 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2025-03-17 11:11:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 368 transitions, 884 flow [2025-03-17 11:11:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2025-03-17 11:11:42,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2025-03-17 11:11:42,447 INFO L175 Difference]: Start difference. First operand has 366 places, 369 transitions, 868 flow. Second operand 3 states and 1189 transitions. [2025-03-17 11:11:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 368 transitions, 884 flow [2025-03-17 11:11:42,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:42,456 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2025-03-17 11:11:42,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=365, PETRI_TRANSITIONS=368} [2025-03-17 11:11:42,457 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2025-03-17 11:11:42,457 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2025-03-17 11:11:42,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:42,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:42,458 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:42,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:42,458 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:42,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 108310606, now seen corresponding path program 1 times [2025-03-17 11:11:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:42,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-17 11:11:42,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:42,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 11:11:42,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 11:11:42,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:42,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-17 11:11:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713062185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133004561] [2025-03-17 11:11:42,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:42,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:42,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:42,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:42,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:42,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 368 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:42,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:42,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:42,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:43,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1064] thread3EXIT-->L82-6: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 479#true, Black: 454#true, 352#L82-6true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,031 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2025-03-17 11:11:43,031 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-17 11:11:43,031 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2025-03-17 11:11:43,031 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2025-03-17 11:11:43,032 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2025-03-17 11:11:43,032 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2025-03-17 11:11:43,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6506 conditions, 5682 events. 199/5682 cut-off events. For 21/68 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 61007 event pairs, 18 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 6206. Up to 166 conditions per place. [2025-03-17 11:11:43,087 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2025-03-17 11:11:43,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2025-03-17 11:11:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2025-03-17 11:11:43,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2025-03-17 11:11:43,089 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2025-03-17 11:11:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2025-03-17 11:11:43,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:43,094 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2025-03-17 11:11:43,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=364, PETRI_TRANSITIONS=366} [2025-03-17 11:11:43,095 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2025-03-17 11:11:43,095 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2025-03-17 11:11:43,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:43,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:43,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:43,096 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-17 11:11:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1825423280, now seen corresponding path program 1 times [2025-03-17 11:11:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957397614] [2025-03-17 11:11:43,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:43,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 11:11:43,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 11:11:43,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:43,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957397614] [2025-03-17 11:11:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957397614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528050588] [2025-03-17 11:11:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:43,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:43,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:43,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:43,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2025-03-17 11:11:43,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 366 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:43,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:43,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2025-03-17 11:11:43,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:43,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 479#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,497 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-17 11:11:43,497 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-17 11:11:43,497 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-17 11:11:43,497 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-17 11:11:43,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1000] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,620 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,620 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,620 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,620 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1000] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,624 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,624 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1000] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,624 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1000] L56-7-->L56-5: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_3|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_3|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, Black: 469#true, 471#(= |#race~filename_7~0| 0), 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,625 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,625 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,626 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,627 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-17 11:11:43,627 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,627 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-17 11:11:43,629 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] thread2EXIT-->L80: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, 177#L56-5true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 471#(= |#race~filename_7~0| 0), Black: 469#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L80true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2025-03-17 11:11:43,629 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2025-03-17 11:11:43,629 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-17 11:11:43,629 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-17 11:11:43,629 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2025-03-17 11:11:43,629 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2025-03-17 11:11:43,631 INFO L124 PetriNetUnfolderBase]: 203/4043 cut-off events. [2025-03-17 11:11:43,631 INFO L125 PetriNetUnfolderBase]: For 61/112 co-relation queries the response was YES. [2025-03-17 11:11:43,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 4043 events. 203/4043 cut-off events. For 61/112 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 41042 event pairs, 48 based on Foata normal form. 12/3767 useless extension candidates. Maximal degree in co-relation 4629. Up to 248 conditions per place. [2025-03-17 11:11:43,662 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2025-03-17 11:11:43,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2025-03-17 11:11:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2025-03-17 11:11:43,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2025-03-17 11:11:43,665 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2025-03-17 11:11:43,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2025-03-17 11:11:43,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:43,669 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2025-03-17 11:11:43,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0} [2025-03-17 11:11:43,669 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2025-03-17 11:11:43,669 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2025-03-17 11:11:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-17 11:11:43,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-17 11:11:43,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-17 11:11:43,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-17 11:11:43,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-17 11:11:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-17 11:11:43,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-17 11:11:43,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:43,677 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-17 11:11:43,681 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:43,681 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:43,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:43 BasicIcfg [2025-03-17 11:11:43,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:43,686 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:43,686 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:43,686 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:43,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:34" (3/4) ... [2025-03-17 11:11:43,687 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:43,689 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:43,690 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:43,690 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:11:43,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 11:11:43,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:43,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:11:43,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:43,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:43,757 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:43,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:43,758 INFO L158 Benchmark]: Toolchain (without parser) took 10267.70ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 113.8MB in the beginning and 738.2MB in the end (delta: -624.4MB). Peak memory consumption was 339.6MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,758 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:43,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.17ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.50ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,759 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 978.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:43,760 INFO L158 Benchmark]: IcfgBuilder took 580.28ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 70.9MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,760 INFO L158 Benchmark]: TraceAbstraction took 9306.58ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 70.4MB in the beginning and 746.6MB in the end (delta: -676.2MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,760 INFO L158 Benchmark]: Witness Printer took 71.09ms. Allocated memory is still 1.1GB. Free memory was 746.6MB in the beginning and 738.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:43,762 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.17ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.50ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 98.0MB in the end (delta: 978.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 580.28ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 70.9MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9306.58ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 70.4MB in the beginning and 746.6MB in the end (delta: -676.2MB). Peak memory consumption was 289.2MB. Max. memory is 16.1GB. * Witness Printer took 71.09ms. Allocated memory is still 1.1GB. Free memory was 746.6MB in the beginning and 738.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 620 locations, 658 edges, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 104 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:43,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE