./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-symm.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 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:12:13,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:12:13,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:12:13,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:12:13,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:12:13,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:12:13,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:12:13,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:12:13,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:12:13,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:12:13,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:12:13,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:13,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:12:13,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:12:13,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:12:13,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:12:13,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:12:13,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:12:13,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:12:13,760 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 -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2025-03-17 11:12:13,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:12:13,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:12:13,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:12:13,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:12:13,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:12:13,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-03-17 11:12:15,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24ab13a/bdcf8f5ace5543589dde30e65aaa8c3f/FLAGc24cd0fcb [2025-03-17 11:12:15,330 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:12:15,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-03-17 11:12:15,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24ab13a/bdcf8f5ace5543589dde30e65aaa8c3f/FLAGc24cd0fcb [2025-03-17 11:12:15,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab24ab13a/bdcf8f5ace5543589dde30e65aaa8c3f [2025-03-17 11:12:15,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:12:15,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:12:15,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:15,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:12:15,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:12:15,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a5ae2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15, skipping insertion in model container [2025-03-17 11:12:15,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:12:15,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:15,493 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:12:15,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:12:15,518 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:12:15,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15 WrapperNode [2025-03-17 11:12:15,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:12:15,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:15,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:12:15,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:12:15,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,547 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2025-03-17 11:12:15,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:12:15,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:12:15,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:12:15,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:12:15,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:12:15,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:12:15,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:12:15,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:12:15,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (1/1) ... [2025-03-17 11:12:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:12:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:12:15,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:12:15,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:12:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:12:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:12:15,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:12:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:12:15,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:12:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:12:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:12:15,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:12:15,616 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:12:15,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:12:15,687 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:12:15,926 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:12:15,927 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:12:15,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:12:15,936 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:12:15,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:15 BoogieIcfgContainer [2025-03-17 11:12:15,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:12:15,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:12:15,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:12:15,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:12:15,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:12:15" (1/3) ... [2025-03-17 11:12:15,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6e628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:15, skipping insertion in model container [2025-03-17 11:12:15,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:12:15" (2/3) ... [2025-03-17 11:12:15,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6e628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:12:15, skipping insertion in model container [2025-03-17 11:12:15,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:15" (3/3) ... [2025-03-17 11:12:15,943 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2025-03-17 11:12:15,952 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:12:15,954 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-symm.wvr.c that has 3 procedures, 242 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-17 11:12:15,955 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:12:16,025 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:12:16,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 255 transitions, 524 flow [2025-03-17 11:12:16,126 INFO L124 PetriNetUnfolderBase]: 14/253 cut-off events. [2025-03-17 11:12:16,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:16,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 14/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 433 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2025-03-17 11:12:16,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 255 transitions, 524 flow [2025-03-17 11:12:16,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 233 transitions, 478 flow [2025-03-17 11:12:16,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:12:16,166 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;@31d9cf50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:12:16,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-17 11:12:16,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:12:16,174 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-17 11:12:16,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:12:16,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,175 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] [2025-03-17 11:12:16,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:16,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1009621899, now seen corresponding path program 1 times [2025-03-17 11:12:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519382430] [2025-03-17 11:12:16,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:12:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:12:16,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519382430] [2025-03-17 11:12:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519382430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138463934] [2025-03-17 11:12:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:16,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 233 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:16,466 INFO L124 PetriNetUnfolderBase]: 17/407 cut-off events. [2025-03-17 11:12:16,466 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-17 11:12:16,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 407 events. 17/407 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1580 event pairs, 5 based on Foata normal form. 13/355 useless extension candidates. Maximal degree in co-relation 317. Up to 21 conditions per place. [2025-03-17 11:12:16,470 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 10 selfloop transitions, 2 changer transitions 2/226 dead transitions. [2025-03-17 11:12:16,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 488 flow [2025-03-17 11:12:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-17 11:12:16,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-17 11:12:16,482 INFO L175 Difference]: Start difference. First operand has 228 places, 233 transitions, 478 flow. Second operand 3 states and 718 transitions. [2025-03-17 11:12:16,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 488 flow [2025-03-17 11:12:16,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 480 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:12:16,509 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 456 flow [2025-03-17 11:12:16,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-03-17 11:12:16,516 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2025-03-17 11:12:16,517 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 456 flow [2025-03-17 11:12:16,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,518 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] [2025-03-17 11:12:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:12:16,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:16,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -714998892, now seen corresponding path program 1 times [2025-03-17 11:12:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675863222] [2025-03-17 11:12:16,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:12:16,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:12:16,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675863222] [2025-03-17 11:12:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675863222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115195168] [2025-03-17 11:12:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-03-17 11:12:16,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-03-17 11:12:16,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:16,631 INFO L124 PetriNetUnfolderBase]: 12/329 cut-off events. [2025-03-17 11:12:16,631 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:12:16,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 329 events. 12/329 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 950 event pairs, 3 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 325. Up to 17 conditions per place. [2025-03-17 11:12:16,633 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-17 11:12:16,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 476 flow [2025-03-17 11:12:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:12:16,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-17 11:12:16,635 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 456 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:12:16,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 476 flow [2025-03-17 11:12:16,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:16,639 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 454 flow [2025-03-17 11:12:16,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2025-03-17 11:12:16,640 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -6 predicate places. [2025-03-17 11:12:16,640 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 454 flow [2025-03-17 11:12:16,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,641 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] [2025-03-17 11:12:16,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:12:16,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:16,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1409398083, now seen corresponding path program 1 times [2025-03-17 11:12:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023396090] [2025-03-17 11:12:16,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:12:16,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:12:16,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023396090] [2025-03-17 11:12:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023396090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491678030] [2025-03-17 11:12:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:16,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:16,745 INFO L124 PetriNetUnfolderBase]: 15/334 cut-off events. [2025-03-17 11:12:16,746 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:12:16,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 334 events. 15/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1114 event pairs, 5 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 327. Up to 21 conditions per place. [2025-03-17 11:12:16,748 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-17 11:12:16,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 476 flow [2025-03-17 11:12:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-17 11:12:16,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.930718954248366 [2025-03-17 11:12:16,751 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 454 flow. Second operand 3 states and 712 transitions. [2025-03-17 11:12:16,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 476 flow [2025-03-17 11:12:16,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:16,755 INFO L231 Difference]: Finished difference. Result has 221 places, 222 transitions, 452 flow [2025-03-17 11:12:16,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=222} [2025-03-17 11:12:16,756 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -7 predicate places. [2025-03-17 11:12:16,757 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 222 transitions, 452 flow [2025-03-17 11:12:16,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,757 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] [2025-03-17 11:12:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:12:16,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2064100474, now seen corresponding path program 1 times [2025-03-17 11:12:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472114126] [2025-03-17 11:12:16,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:12:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:12:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472114126] [2025-03-17 11:12:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472114126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325841795] [2025-03-17 11:12:16,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2025-03-17 11:12:16,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2025-03-17 11:12:16,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:16,872 INFO L124 PetriNetUnfolderBase]: 12/330 cut-off events. [2025-03-17 11:12:16,873 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-17 11:12:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 330 events. 12/330 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 956 event pairs, 3 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 310. Up to 17 conditions per place. [2025-03-17 11:12:16,874 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-17 11:12:16,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 472 flow [2025-03-17 11:12:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:12:16,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-17 11:12:16,878 INFO L175 Difference]: Start difference. First operand has 221 places, 222 transitions, 452 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:12:16,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 221 transitions, 472 flow [2025-03-17 11:12:16,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:16,882 INFO L231 Difference]: Finished difference. Result has 220 places, 221 transitions, 450 flow [2025-03-17 11:12:16,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2025-03-17 11:12:16,884 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-17 11:12:16,884 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 450 flow [2025-03-17 11:12:16,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:16,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:12:16,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:16,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash -633522246, now seen corresponding path program 1 times [2025-03-17 11:12:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637135109] [2025-03-17 11:12:16,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:12:16,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:12:16,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637135109] [2025-03-17 11:12:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637135109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180382109] [2025-03-17 11:12:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:16,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:16,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:16,999 INFO L124 PetriNetUnfolderBase]: 32/560 cut-off events. [2025-03-17 11:12:16,999 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:12:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 560 events. 32/560 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2689 event pairs, 9 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 554. Up to 36 conditions per place. [2025-03-17 11:12:17,001 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-17 11:12:17,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 222 transitions, 483 flow [2025-03-17 11:12:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-17 11:12:17,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-03-17 11:12:17,004 INFO L175 Difference]: Start difference. First operand has 220 places, 221 transitions, 450 flow. Second operand 3 states and 717 transitions. [2025-03-17 11:12:17,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 222 transitions, 483 flow [2025-03-17 11:12:17,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,007 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 461 flow [2025-03-17 11:12:17,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-03-17 11:12:17,008 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-03-17 11:12:17,008 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 461 flow [2025-03-17 11:12:17,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:12:17,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1174455256, now seen corresponding path program 1 times [2025-03-17 11:12:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842399079] [2025-03-17 11:12:17,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:12:17,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:12:17,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842399079] [2025-03-17 11:12:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842399079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008791958] [2025-03-17 11:12:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:17,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:17,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,112 INFO L124 PetriNetUnfolderBase]: 34/573 cut-off events. [2025-03-17 11:12:17,112 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-17 11:12:17,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 573 events. 34/573 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2897 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. [2025-03-17 11:12:17,114 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2025-03-17 11:12:17,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 494 flow [2025-03-17 11:12:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-03-17 11:12:17,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2025-03-17 11:12:17,116 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 461 flow. Second operand 3 states and 717 transitions. [2025-03-17 11:12:17,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 222 transitions, 494 flow [2025-03-17 11:12:17,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:17,120 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 476 flow [2025-03-17 11:12:17,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2025-03-17 11:12:17,121 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2025-03-17 11:12:17,122 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 476 flow [2025-03-17 11:12:17,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:12:17,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1362839357, now seen corresponding path program 1 times [2025-03-17 11:12:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730936500] [2025-03-17 11:12:17,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:12:17,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:12:17,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730936500] [2025-03-17 11:12:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730936500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368459788] [2025-03-17 11:12:17,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-03-17 11:12:17,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-03-17 11:12:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,255 INFO L124 PetriNetUnfolderBase]: 25/689 cut-off events. [2025-03-17 11:12:17,255 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-17 11:12:17,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 689 events. 25/689 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3456 event pairs, 2 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 623. Up to 32 conditions per place. [2025-03-17 11:12:17,257 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-03-17 11:12:17,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 513 flow [2025-03-17 11:12:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-17 11:12:17,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-03-17 11:12:17,258 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 476 flow. Second operand 3 states and 724 transitions. [2025-03-17 11:12:17,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 513 flow [2025-03-17 11:12:17,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 224 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:17,261 INFO L231 Difference]: Finished difference. Result has 219 places, 221 transitions, 486 flow [2025-03-17 11:12:17,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=219, PETRI_TRANSITIONS=221} [2025-03-17 11:12:17,262 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-03-17 11:12:17,262 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 221 transitions, 486 flow [2025-03-17 11:12:17,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,262 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] [2025-03-17 11:12:17,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:12:17,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1881905573, now seen corresponding path program 1 times [2025-03-17 11:12:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251683639] [2025-03-17 11:12:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:12:17,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:12:17,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251683639] [2025-03-17 11:12:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251683639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918987026] [2025-03-17 11:12:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-03-17 11:12:17,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 221 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-03-17 11:12:17,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,388 INFO L124 PetriNetUnfolderBase]: 26/630 cut-off events. [2025-03-17 11:12:17,388 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-03-17 11:12:17,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 630 events. 26/630 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2982 event pairs, 4 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 591. Up to 25 conditions per place. [2025-03-17 11:12:17,392 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-17 11:12:17,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 221 transitions, 511 flow [2025-03-17 11:12:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-17 11:12:17,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-17 11:12:17,394 INFO L175 Difference]: Start difference. First operand has 219 places, 221 transitions, 486 flow. Second operand 3 states and 718 transitions. [2025-03-17 11:12:17,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 221 transitions, 511 flow [2025-03-17 11:12:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:17,400 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 488 flow [2025-03-17 11:12:17,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2025-03-17 11:12:17,401 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-17 11:12:17,401 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 488 flow [2025-03-17 11:12:17,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,402 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] [2025-03-17 11:12:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:12:17,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 276419174, now seen corresponding path program 1 times [2025-03-17 11:12:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127823403] [2025-03-17 11:12:17,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 11:12:17,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 11:12:17,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127823403] [2025-03-17 11:12:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127823403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838144664] [2025-03-17 11:12:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2025-03-17 11:12:17,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2025-03-17 11:12:17,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,501 INFO L124 PetriNetUnfolderBase]: 26/722 cut-off events. [2025-03-17 11:12:17,501 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-17 11:12:17,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 722 events. 26/722 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3781 event pairs, 4 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 681. Up to 33 conditions per place. [2025-03-17 11:12:17,504 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-17 11:12:17,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 223 transitions, 525 flow [2025-03-17 11:12:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-17 11:12:17,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2025-03-17 11:12:17,506 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 488 flow. Second operand 3 states and 724 transitions. [2025-03-17 11:12:17,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 223 transitions, 525 flow [2025-03-17 11:12:17,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 223 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,508 INFO L231 Difference]: Finished difference. Result has 219 places, 220 transitions, 494 flow [2025-03-17 11:12:17,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2025-03-17 11:12:17,509 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2025-03-17 11:12:17,509 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 494 flow [2025-03-17 11:12:17,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:12:17,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 401602158, now seen corresponding path program 1 times [2025-03-17 11:12:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200197046] [2025-03-17 11:12:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 11:12:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 11:12:17,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200197046] [2025-03-17 11:12:17,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200197046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492121750] [2025-03-17 11:12:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2025-03-17 11:12:17,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2025-03-17 11:12:17,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,617 INFO L124 PetriNetUnfolderBase]: 33/577 cut-off events. [2025-03-17 11:12:17,617 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-17 11:12:17,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 577 events. 33/577 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2594 event pairs, 4 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 569. Up to 47 conditions per place. [2025-03-17 11:12:17,620 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-17 11:12:17,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 220 transitions, 519 flow [2025-03-17 11:12:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-17 11:12:17,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2025-03-17 11:12:17,622 INFO L175 Difference]: Start difference. First operand has 219 places, 220 transitions, 494 flow. Second operand 3 states and 718 transitions. [2025-03-17 11:12:17,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 220 transitions, 519 flow [2025-03-17 11:12:17,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:17,627 INFO L231 Difference]: Finished difference. Result has 220 places, 219 transitions, 496 flow [2025-03-17 11:12:17,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=220, PETRI_TRANSITIONS=219} [2025-03-17 11:12:17,627 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2025-03-17 11:12:17,627 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 496 flow [2025-03-17 11:12:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,628 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] [2025-03-17 11:12:17,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:12:17,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash 249070961, now seen corresponding path program 1 times [2025-03-17 11:12:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011392734] [2025-03-17 11:12:17,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:12:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:12:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011392734] [2025-03-17 11:12:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011392734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182675605] [2025-03-17 11:12:17,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:17,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:17,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,762 INFO L124 PetriNetUnfolderBase]: 21/625 cut-off events. [2025-03-17 11:12:17,762 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-17 11:12:17,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 625 events. 21/625 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2950 event pairs, 2 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 605. Up to 18 conditions per place. [2025-03-17 11:12:17,765 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 10 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2025-03-17 11:12:17,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 512 flow [2025-03-17 11:12:17,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-17 11:12:17,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320261437908497 [2025-03-17 11:12:17,767 INFO L175 Difference]: Start difference. First operand has 220 places, 219 transitions, 496 flow. Second operand 3 states and 713 transitions. [2025-03-17 11:12:17,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 512 flow [2025-03-17 11:12:17,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:17,770 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 488 flow [2025-03-17 11:12:17,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-03-17 11:12:17,771 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2025-03-17 11:12:17,771 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 488 flow [2025-03-17 11:12:17,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:17,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:12:17,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-17 11:12:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1048592270, now seen corresponding path program 1 times [2025-03-17 11:12:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676058889] [2025-03-17 11:12:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:17,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:12:17,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:12:17,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:17,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:17,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676058889] [2025-03-17 11:12:17,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676058889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:17,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:17,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:17,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585999570] [2025-03-17 11:12:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:17,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:17,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:17,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:17,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:17,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2025-03-17 11:12:17,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:17,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2025-03-17 11:12:17,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:17,892 INFO L124 PetriNetUnfolderBase]: 23/596 cut-off events. [2025-03-17 11:12:17,893 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-03-17 11:12:17,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 596 events. 23/596 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2501 event pairs, 2 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 556. Up to 25 conditions per place. [2025-03-17 11:12:17,894 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 0 selfloop transitions, 0 changer transitions 215/215 dead transitions. [2025-03-17 11:12:17,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 215 transitions, 510 flow [2025-03-17 11:12:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-17 11:12:17,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-17 11:12:17,896 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 488 flow. Second operand 3 states and 714 transitions. [2025-03-17 11:12:17,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 215 transitions, 510 flow [2025-03-17 11:12:17,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:17,900 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2025-03-17 11:12:17,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=215, PETRI_TRANSITIONS=0} [2025-03-17 11:12:17,902 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -13 predicate places. [2025-03-17 11:12:17,902 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2025-03-17 11:12:17,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:17,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-03-17 11:12:17,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-03-17 11:12:17,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-03-17 11:12:17,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-03-17 11:12:17,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-03-17 11:12:17,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-03-17 11:12:17,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-03-17 11:12:17,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-03-17 11:12:17,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-03-17 11:12:17,908 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-03-17 11:12:17,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:17,908 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:17,912 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:12:17,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:12:17,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:12:17 BasicIcfg [2025-03-17 11:12:17,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:12:17,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:12:17,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:12:17,920 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:12:17,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:12:15" (3/4) ... [2025-03-17 11:12:17,922 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:12:17,924 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:12:17,924 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:12:17,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 11:12:17,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:12:17,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:12:17,928 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:12:17,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:12:17,991 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:12:17,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:12:17,991 INFO L158 Benchmark]: Toolchain (without parser) took 2634.60ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.6MB in the beginning and 200.2MB in the end (delta: -75.6MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2025-03-17 11:12:17,992 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:17,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.38ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 113.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:17,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.19ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 111.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:17,993 INFO L158 Benchmark]: Boogie Preprocessor took 13.17ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:12:17,994 INFO L158 Benchmark]: IcfgBuilder took 371.92ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 89.5MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:12:17,994 INFO L158 Benchmark]: TraceAbstraction took 1981.28ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 89.0MB in the beginning and 205.8MB in the end (delta: -116.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2025-03-17 11:12:17,995 INFO L158 Benchmark]: Witness Printer took 70.98ms. Allocated memory is still 335.5MB. Free memory was 205.8MB in the beginning and 200.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:12:17,996 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.23ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.38ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 113.2MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.19ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 111.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.17ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 110.2MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 371.92ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 89.5MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1981.28ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 89.0MB in the beginning and 205.8MB in the end (delta: -116.8MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * Witness Printer took 70.98ms. Allocated memory is still 335.5MB. Free memory was 205.8MB in the beginning and 200.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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 5 procedures, 360 locations, 381 edges, 36 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.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 71 mSDtfsCounter, 295 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=496occurred in iteration=10, 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, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 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 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:12:18,010 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