./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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-sre-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 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:43:29,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:43:29,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:43:29,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:43:29,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:43:29,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:43:29,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:43:29,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:43:29,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:43:29,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:43:29,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:43:29,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:43:29,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:43:29,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:43:29,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:29,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:43:29,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:43:29,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:43:29,735 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 -> 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c [2025-03-14 01:43:29,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:43:29,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:43:29,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:43:29,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:43:29,976 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:43:29,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-03-14 01:43:31,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0219fd9e4/b981cb0cf8d54bf29929695e9ab5cb3d/FLAG1a19d1f80 [2025-03-14 01:43:31,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:43:31,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-03-14 01:43:31,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0219fd9e4/b981cb0cf8d54bf29929695e9ab5cb3d/FLAG1a19d1f80 [2025-03-14 01:43:31,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0219fd9e4/b981cb0cf8d54bf29929695e9ab5cb3d [2025-03-14 01:43:31,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:43:31,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:43:31,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:31,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:43:31,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:43:31,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3316058d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31, skipping insertion in model container [2025-03-14 01:43:31,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:43:31,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:31,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:43:31,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:43:31,864 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:43:31,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31 WrapperNode [2025-03-14 01:43:31,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:43:31,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:31,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:43:31,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:43:31,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,896 INFO L138 Inliner]: procedures = 21, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2025-03-14 01:43:31,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:43:31,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:43:31,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:43:31,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:43:31,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,910 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:43:31,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:43:31,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:43:31,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:43:31,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (1/1) ... [2025-03-14 01:43:31,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:43:31,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:43:31,952 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-14 01:43:31,955 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-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:43:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:43:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:43:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:43:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:43:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:43:31,972 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:43:32,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:43:32,036 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:43:32,279 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:43:32,280 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:43:32,281 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:43:32,299 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:43:32,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:32 BoogieIcfgContainer [2025-03-14 01:43:32,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:43:32,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:43:32,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:43:32,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:43:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:43:31" (1/3) ... [2025-03-14 01:43:32,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46959801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:32, skipping insertion in model container [2025-03-14 01:43:32,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:43:31" (2/3) ... [2025-03-14 01:43:32,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46959801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:43:32, skipping insertion in model container [2025-03-14 01:43:32,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:32" (3/3) ... [2025-03-14 01:43:32,309 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2025-03-14 01:43:32,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:43:32,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-subst.wvr.c that has 4 procedures, 176 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-14 01:43:32,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:43:32,412 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:43:32,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 181 transitions, 383 flow [2025-03-14 01:43:32,502 INFO L124 PetriNetUnfolderBase]: 6/178 cut-off events. [2025-03-14 01:43:32,503 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:43:32,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 178 events. 6/178 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 264 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2025-03-14 01:43:32,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 181 transitions, 383 flow [2025-03-14 01:43:32,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 158 transitions, 334 flow [2025-03-14 01:43:32,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:43:32,529 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;@1d686bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:43:32,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-14 01:43:32,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:43:32,536 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:43:32,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:43:32,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,536 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] [2025-03-14 01:43:32,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1167844438, now seen corresponding path program 1 times [2025-03-14 01:43:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512239810] [2025-03-14 01:43:32,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:43:32,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:43:32,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,692 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-14 01:43:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512239810] [2025-03-14 01:43:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512239810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473694172] [2025-03-14 01:43:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 181 [2025-03-14 01:43:32,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-14 01:43:32,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 181 [2025-03-14 01:43:32,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:32,830 INFO L124 PetriNetUnfolderBase]: 16/295 cut-off events. [2025-03-14 01:43:32,830 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 01:43:32,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 295 events. 16/295 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1008 event pairs, 7 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 226. Up to 25 conditions per place. [2025-03-14 01:43:32,839 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 11 selfloop transitions, 2 changer transitions 1/156 dead transitions. [2025-03-14 01:43:32,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 356 flow [2025-03-14 01:43:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2025-03-14 01:43:32,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9281767955801105 [2025-03-14 01:43:32,858 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 334 flow. Second operand 3 states and 504 transitions. [2025-03-14 01:43:32,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 356 flow [2025-03-14 01:43:32,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 156 transitions, 344 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:43:32,869 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 320 flow [2025-03-14 01:43:32,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2025-03-14 01:43:32,875 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -5 predicate places. [2025-03-14 01:43:32,877 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 320 flow [2025-03-14 01:43:32,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-14 01:43:32,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:32,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:43:32,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:32,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 294608149, now seen corresponding path program 1 times [2025-03-14 01:43:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540013891] [2025-03-14 01:43:32,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:43:32,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:43:32,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,940 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-14 01:43:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540013891] [2025-03-14 01:43:32,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540013891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775948492] [2025-03-14 01:43:32,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:32,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 181 [2025-03-14 01:43:32,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-14 01:43:32,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 181 [2025-03-14 01:43:32,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,036 INFO L124 PetriNetUnfolderBase]: 14/221 cut-off events. [2025-03-14 01:43:33,037 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:43:33,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 221 events. 14/221 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 619 event pairs, 8 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 232. Up to 29 conditions per place. [2025-03-14 01:43:33,039 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-03-14 01:43:33,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 154 transitions, 346 flow [2025-03-14 01:43:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2025-03-14 01:43:33,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9226519337016574 [2025-03-14 01:43:33,041 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 320 flow. Second operand 3 states and 501 transitions. [2025-03-14 01:43:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 154 transitions, 346 flow [2025-03-14 01:43:33,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,043 INFO L231 Difference]: Finished difference. Result has 157 places, 154 transitions, 318 flow [2025-03-14 01:43:33,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=157, PETRI_TRANSITIONS=154} [2025-03-14 01:43:33,044 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -7 predicate places. [2025-03-14 01:43:33,044 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 318 flow [2025-03-14 01:43:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-14 01:43:33,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,045 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] [2025-03-14 01:43:33,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:43:33,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1691376232, now seen corresponding path program 1 times [2025-03-14 01:43:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46525528] [2025-03-14 01:43:33,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:43:33,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:43:33,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,100 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-14 01:43:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46525528] [2025-03-14 01:43:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46525528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095246734] [2025-03-14 01:43:33,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2025-03-14 01:43:33,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 154 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-14 01:43:33,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2025-03-14 01:43:33,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,184 INFO L124 PetriNetUnfolderBase]: 27/257 cut-off events. [2025-03-14 01:43:33,184 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-14 01:43:33,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 257 events. 27/257 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 895 event pairs, 20 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 279. Up to 50 conditions per place. [2025-03-14 01:43:33,188 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 13 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-03-14 01:43:33,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 346 flow [2025-03-14 01:43:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2025-03-14 01:43:33,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9189686924493554 [2025-03-14 01:43:33,190 INFO L175 Difference]: Start difference. First operand has 157 places, 154 transitions, 318 flow. Second operand 3 states and 499 transitions. [2025-03-14 01:43:33,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 346 flow [2025-03-14 01:43:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 153 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,192 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 316 flow [2025-03-14 01:43:33,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2025-03-14 01:43:33,193 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -8 predicate places. [2025-03-14 01:43:33,193 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 316 flow [2025-03-14 01:43:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-14 01:43:33,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:33,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:43:33,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 517667578, now seen corresponding path program 1 times [2025-03-14 01:43:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038735036] [2025-03-14 01:43:33,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:43:33,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:43:33,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,246 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-14 01:43:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038735036] [2025-03-14 01:43:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038735036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056621997] [2025-03-14 01:43:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2025-03-14 01:43:33,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-14 01:43:33,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2025-03-14 01:43:33,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,303 INFO L124 PetriNetUnfolderBase]: 34/414 cut-off events. [2025-03-14 01:43:33,304 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:43:33,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 414 events. 34/414 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2000 event pairs, 13 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 432. Up to 43 conditions per place. [2025-03-14 01:43:33,307 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 13 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-03-14 01:43:33,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 155 transitions, 352 flow [2025-03-14 01:43:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-03-14 01:43:33,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2025-03-14 01:43:33,308 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 316 flow. Second operand 3 states and 512 transitions. [2025-03-14 01:43:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 155 transitions, 352 flow [2025-03-14 01:43:33,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 155 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,312 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 322 flow [2025-03-14 01:43:33,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2025-03-14 01:43:33,313 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2025-03-14 01:43:33,313 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 322 flow [2025-03-14 01:43:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-14 01:43:33,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:43:33,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash -737653285, now seen corresponding path program 1 times [2025-03-14 01:43:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926567648] [2025-03-14 01:43:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:43:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:43:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,357 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-14 01:43:33,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926567648] [2025-03-14 01:43:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926567648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415199884] [2025-03-14 01:43:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 181 [2025-03-14 01:43:33,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-14 01:43:33,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 181 [2025-03-14 01:43:33,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,422 INFO L124 PetriNetUnfolderBase]: 32/331 cut-off events. [2025-03-14 01:43:33,423 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:43:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 331 events. 32/331 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1319 event pairs, 10 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 324. Up to 49 conditions per place. [2025-03-14 01:43:33,426 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 15 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2025-03-14 01:43:33,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 154 transitions, 360 flow [2025-03-14 01:43:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-14 01:43:33,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9318600368324125 [2025-03-14 01:43:33,428 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 322 flow. Second operand 3 states and 506 transitions. [2025-03-14 01:43:33,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 154 transitions, 360 flow [2025-03-14 01:43:33,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:33,431 INFO L231 Difference]: Finished difference. Result has 155 places, 152 transitions, 330 flow [2025-03-14 01:43:33,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=155, PETRI_TRANSITIONS=152} [2025-03-14 01:43:33,432 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2025-03-14 01:43:33,433 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 152 transitions, 330 flow [2025-03-14 01:43:33,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-14 01:43:33,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,434 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] [2025-03-14 01:43:33,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:43:33,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 920331174, now seen corresponding path program 1 times [2025-03-14 01:43:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453253330] [2025-03-14 01:43:33,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:43:33,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:43:33,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,487 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-14 01:43:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453253330] [2025-03-14 01:43:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453253330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531872202] [2025-03-14 01:43:33,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2025-03-14 01:43:33,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 152 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-14 01:43:33,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2025-03-14 01:43:33,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,571 INFO L124 PetriNetUnfolderBase]: 131/680 cut-off events. [2025-03-14 01:43:33,571 INFO L125 PetriNetUnfolderBase]: For 31/36 co-relation queries the response was YES. [2025-03-14 01:43:33,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 680 events. 131/680 cut-off events. For 31/36 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4220 event pairs, 52 based on Foata normal form. 1/607 useless extension candidates. Maximal degree in co-relation 669. Up to 202 conditions per place. [2025-03-14 01:43:33,575 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 17 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-03-14 01:43:33,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 152 transitions, 370 flow [2025-03-14 01:43:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2025-03-14 01:43:33,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9208103130755064 [2025-03-14 01:43:33,577 INFO L175 Difference]: Start difference. First operand has 155 places, 152 transitions, 330 flow. Second operand 3 states and 500 transitions. [2025-03-14 01:43:33,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 152 transitions, 370 flow [2025-03-14 01:43:33,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:33,578 INFO L231 Difference]: Finished difference. Result has 154 places, 150 transitions, 336 flow [2025-03-14 01:43:33,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=154, PETRI_TRANSITIONS=150} [2025-03-14 01:43:33,579 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2025-03-14 01:43:33,579 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 150 transitions, 336 flow [2025-03-14 01:43:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-14 01:43:33,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,580 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] [2025-03-14 01:43:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:43:33,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2078246593, now seen corresponding path program 1 times [2025-03-14 01:43:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993756922] [2025-03-14 01:43:33,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:43:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:43:33,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,634 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-14 01:43:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993756922] [2025-03-14 01:43:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993756922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192142260] [2025-03-14 01:43:33,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 181 [2025-03-14 01:43:33,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 150 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-14 01:43:33,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 181 [2025-03-14 01:43:33,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,678 INFO L124 PetriNetUnfolderBase]: 25/324 cut-off events. [2025-03-14 01:43:33,678 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-03-14 01:43:33,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 324 events. 25/324 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1302 event pairs, 4 based on Foata normal form. 1/295 useless extension candidates. Maximal degree in co-relation 300. Up to 18 conditions per place. [2025-03-14 01:43:33,680 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 11 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-14 01:43:33,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 366 flow [2025-03-14 01:43:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-03-14 01:43:33,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2025-03-14 01:43:33,682 INFO L175 Difference]: Start difference. First operand has 154 places, 150 transitions, 336 flow. Second operand 3 states and 512 transitions. [2025-03-14 01:43:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 366 flow [2025-03-14 01:43:33,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 151 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:33,684 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 338 flow [2025-03-14 01:43:33,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-03-14 01:43:33,684 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -9 predicate places. [2025-03-14 01:43:33,685 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 338 flow [2025-03-14 01:43:33,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-14 01:43:33,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:33,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:43:33,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1549928212, now seen corresponding path program 1 times [2025-03-14 01:43:33,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401478292] [2025-03-14 01:43:33,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:43:33,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:43:33,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,723 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-14 01:43:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401478292] [2025-03-14 01:43:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401478292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755554146] [2025-03-14 01:43:33,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2025-03-14 01:43:33,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-14 01:43:33,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2025-03-14 01:43:33,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,771 INFO L124 PetriNetUnfolderBase]: 29/332 cut-off events. [2025-03-14 01:43:33,771 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-14 01:43:33,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 332 events. 29/332 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1423 event pairs, 6 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 363. Up to 25 conditions per place. [2025-03-14 01:43:33,773 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-14 01:43:33,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 370 flow [2025-03-14 01:43:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-14 01:43:33,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2025-03-14 01:43:33,776 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 338 flow. Second operand 3 states and 510 transitions. [2025-03-14 01:43:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 370 flow [2025-03-14 01:43:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 150 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,778 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 336 flow [2025-03-14 01:43:33,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-03-14 01:43:33,779 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2025-03-14 01:43:33,779 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 336 flow [2025-03-14 01:43:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-14 01:43:33,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,779 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] [2025-03-14 01:43:33,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:43:33,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 823717477, now seen corresponding path program 1 times [2025-03-14 01:43:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881293136] [2025-03-14 01:43:33,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:43:33,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:43:33,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:33,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881293136] [2025-03-14 01:43:33,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881293136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870898816] [2025-03-14 01:43:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2025-03-14 01:43:33,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-14 01:43:33,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2025-03-14 01:43:33,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,878 INFO L124 PetriNetUnfolderBase]: 25/261 cut-off events. [2025-03-14 01:43:33,879 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-03-14 01:43:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 261 events. 25/261 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 832 event pairs, 6 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 285. Up to 31 conditions per place. [2025-03-14 01:43:33,881 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 12 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-14 01:43:33,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 149 transitions, 368 flow [2025-03-14 01:43:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-14 01:43:33,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2025-03-14 01:43:33,882 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 336 flow. Second operand 3 states and 510 transitions. [2025-03-14 01:43:33,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 149 transitions, 368 flow [2025-03-14 01:43:33,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,884 INFO L231 Difference]: Finished difference. Result has 153 places, 147 transitions, 334 flow [2025-03-14 01:43:33,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=153, PETRI_TRANSITIONS=147} [2025-03-14 01:43:33,885 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -11 predicate places. [2025-03-14 01:43:33,886 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 147 transitions, 334 flow [2025-03-14 01:43:33,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-14 01:43:33,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,886 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] [2025-03-14 01:43:33,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:43:33,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash -121462030, now seen corresponding path program 1 times [2025-03-14 01:43:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062490837] [2025-03-14 01:43:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-14 01:43:33,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-14 01:43:33,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:33,935 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-14 01:43:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062490837] [2025-03-14 01:43:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062490837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335367807] [2025-03-14 01:43:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:33,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:33,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:33,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:33,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 181 [2025-03-14 01:43:33,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 147 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-14 01:43:33,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:33,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 181 [2025-03-14 01:43:33,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:33,969 INFO L124 PetriNetUnfolderBase]: 19/295 cut-off events. [2025-03-14 01:43:33,969 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:33,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 295 events. 19/295 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1070 event pairs, 2 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 280. Up to 14 conditions per place. [2025-03-14 01:43:33,971 INFO L140 encePairwiseOnDemand]: 179/181 looper letters, 8 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2025-03-14 01:43:33,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 146 transitions, 350 flow [2025-03-14 01:43:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-14 01:43:33,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465930018416207 [2025-03-14 01:43:33,972 INFO L175 Difference]: Start difference. First operand has 153 places, 147 transitions, 334 flow. Second operand 3 states and 514 transitions. [2025-03-14 01:43:33,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 146 transitions, 350 flow [2025-03-14 01:43:33,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 146 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:33,974 INFO L231 Difference]: Finished difference. Result has 152 places, 146 transitions, 330 flow [2025-03-14 01:43:33,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=152, PETRI_TRANSITIONS=146} [2025-03-14 01:43:33,975 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -12 predicate places. [2025-03-14 01:43:33,975 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 146 transitions, 330 flow [2025-03-14 01:43:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-14 01:43:33,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:33,975 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-14 01:43:33,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:43:33,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:33,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1794800291, now seen corresponding path program 1 times [2025-03-14 01:43:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:33,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907211908] [2025-03-14 01:43:33,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:33,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:33,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:43:33,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:43:33,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:33,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,016 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-14 01:43:34,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907211908] [2025-03-14 01:43:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907211908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766460959] [2025-03-14 01:43:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2025-03-14 01:43:34,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 146 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-14 01:43:34,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2025-03-14 01:43:34,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,059 INFO L124 PetriNetUnfolderBase]: 20/294 cut-off events. [2025-03-14 01:43:34,059 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:34,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 294 events. 20/294 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1062 event pairs, 3 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 329. Up to 16 conditions per place. [2025-03-14 01:43:34,060 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 10 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2025-03-14 01:43:34,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 348 flow [2025-03-14 01:43:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-03-14 01:43:34,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9355432780847146 [2025-03-14 01:43:34,062 INFO L175 Difference]: Start difference. First operand has 152 places, 146 transitions, 330 flow. Second operand 3 states and 508 transitions. [2025-03-14 01:43:34,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 348 flow [2025-03-14 01:43:34,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 144 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:34,064 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 327 flow [2025-03-14 01:43:34,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-03-14 01:43:34,064 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -13 predicate places. [2025-03-14 01:43:34,064 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 327 flow [2025-03-14 01:43:34,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-14 01:43:34,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:34,065 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] [2025-03-14 01:43:34,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:43:34,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-14 01:43:34,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1436081591, now seen corresponding path program 1 times [2025-03-14 01:43:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:34,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674468918] [2025-03-14 01:43:34,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:34,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-14 01:43:34,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-14 01:43:34,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:34,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:34,120 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-14 01:43:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:34,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674468918] [2025-03-14 01:43:34,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674468918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:34,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:34,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43587949] [2025-03-14 01:43:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:34,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:34,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 181 [2025-03-14 01:43:34,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-14 01:43:34,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:34,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 181 [2025-03-14 01:43:34,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:34,156 INFO L124 PetriNetUnfolderBase]: 16/231 cut-off events. [2025-03-14 01:43:34,156 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-14 01:43:34,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 231 events. 16/231 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 679 event pairs, 3 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 269. Up to 18 conditions per place. [2025-03-14 01:43:34,157 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2025-03-14 01:43:34,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 142 transitions, 343 flow [2025-03-14 01:43:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-03-14 01:43:34,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337016574585635 [2025-03-14 01:43:34,159 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 327 flow. Second operand 3 states and 507 transitions. [2025-03-14 01:43:34,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 142 transitions, 343 flow [2025-03-14 01:43:34,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 142 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:34,160 INFO L231 Difference]: Finished difference. Result has 150 places, 0 transitions, 0 flow [2025-03-14 01:43:34,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=150, PETRI_TRANSITIONS=0} [2025-03-14 01:43:34,161 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, -14 predicate places. [2025-03-14 01:43:34,161 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 0 transitions, 0 flow [2025-03-14 01:43:34,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-14 01:43:34,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-03-14 01:43:34,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-03-14 01:43:34,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-03-14 01:43:34,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-03-14 01:43:34,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:43:34,166 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:34,170 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:43:34,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:43:34,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:43:34 BasicIcfg [2025-03-14 01:43:34,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:43:34,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:43:34,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:43:34,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:43:34,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:43:32" (3/4) ... [2025-03-14 01:43:34,177 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:43:34,179 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:43:34,179 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:43:34,179 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:43:34,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-14 01:43:34,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:43:34,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:43:34,183 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:43:34,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:43:34,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:43:34,257 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:43:34,258 INFO L158 Benchmark]: Toolchain (without parser) took 2584.33ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 132.1MB in the end (delta: -7.8MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2025-03-14 01:43:34,258 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:34,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.10ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 112.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:34,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.41ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 946.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:34,259 INFO L158 Benchmark]: Boogie Preprocessor took 21.11ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.9MB in the end (delta: 772.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:43:34,261 INFO L158 Benchmark]: IcfgBuilder took 376.87ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 93.2MB in the end (delta: 17.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:43:34,262 INFO L158 Benchmark]: TraceAbstraction took 1872.44ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 45.7MB in the end (delta: 47.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-03-14 01:43:34,262 INFO L158 Benchmark]: Witness Printer took 81.60ms. Allocated memory is still 167.8MB. Free memory was 45.7MB in the beginning and 132.1MB in the end (delta: -86.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:43:34,263 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.10ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 112.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.41ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 946.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.11ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 110.9MB in the end (delta: 772.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 376.87ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 93.2MB in the end (delta: 17.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1872.44ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 45.7MB in the end (delta: 47.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * Witness Printer took 81.60ms. Allocated memory is still 167.8MB. Free memory was 45.7MB in the beginning and 132.1MB in the end (delta: -86.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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, 248 locations, 35 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: 1.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 235 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 56 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=7, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:43:34,275 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