./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:53,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:53,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:38:53,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:53,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:53,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:53,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:53,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:53,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:53,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:53,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:53,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:53,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:53,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:53,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:53,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:53,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2025-02-08 05:38:53,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:53,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:53,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:53,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:53,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:53,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-02-08 05:38:54,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/811a62ee5/62564d9840f14decb9ec975ebe57b780/FLAGed01cdea8 [2025-02-08 05:38:54,770 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:54,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-02-08 05:38:54,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/811a62ee5/62564d9840f14decb9ec975ebe57b780/FLAGed01cdea8 [2025-02-08 05:38:54,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/811a62ee5/62564d9840f14decb9ec975ebe57b780 [2025-02-08 05:38:54,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:54,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:54,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:54,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:54,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:54,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:54,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73454367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54, skipping insertion in model container [2025-02-08 05:38:54,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:54,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:54,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:54,963 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:54,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:54,989 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:54,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54 WrapperNode [2025-02-08 05:38:54,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:54,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:54,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:54,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:54,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,018 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-02-08 05:38:55,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:55,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:55,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:55,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:55,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:55,048 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:55,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:55,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:55,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (1/1) ... [2025-02-08 05:38:55,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:55,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:38:55,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:38:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:55,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:38:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:38:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:55,123 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:38:55,199 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:55,200 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:55,423 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:55,423 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:55,431 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:55,431 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:55,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:55 BoogieIcfgContainer [2025-02-08 05:38:55,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:55,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:55,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:55,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:55,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:54" (1/3) ... [2025-02-08 05:38:55,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c88e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:55, skipping insertion in model container [2025-02-08 05:38:55,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:54" (2/3) ... [2025-02-08 05:38:55,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c88e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:55, skipping insertion in model container [2025-02-08 05:38:55,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:55" (3/3) ... [2025-02-08 05:38:55,437 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-02-08 05:38:55,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:55,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 165 locations, 1 initial locations, 3 loop locations, and 19 error locations. [2025-02-08 05:38:55,449 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:55,551 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:38:55,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 171 transitions, 363 flow [2025-02-08 05:38:55,639 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2025-02-08 05:38:55,641 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:38:55,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 7/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 280 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2025-02-08 05:38:55,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 171 transitions, 363 flow [2025-02-08 05:38:55,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 151 transitions, 320 flow [2025-02-08 05:38:55,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:55,664 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;@57154739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:55,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:38:55,669 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:55,670 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:38:55,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:55,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:55,671 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-02-08 05:38:55,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1468208956, now seen corresponding path program 1 times [2025-02-08 05:38:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992450791] [2025-02-08 05:38:55,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:55,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:38:55,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:38:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992450791] [2025-02-08 05:38:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992450791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:55,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:55,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:55,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050719188] [2025-02-08 05:38:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:55,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:55,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:55,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:55,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-02-08 05:38:55,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:55,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:55,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-02-08 05:38:55,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:55,993 INFO L124 PetriNetUnfolderBase]: 10/216 cut-off events. [2025-02-08 05:38:55,993 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:38:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 216 events. 10/216 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 698 event pairs, 5 based on Foata normal form. 16/200 useless extension candidates. Maximal degree in co-relation 175. Up to 22 conditions per place. [2025-02-08 05:38:55,999 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-02-08 05:38:55,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 338 flow [2025-02-08 05:38:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-02-08 05:38:56,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2025-02-08 05:38:56,015 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 320 flow. Second operand 3 states and 470 transitions. [2025-02-08 05:38:56,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 338 flow [2025-02-08 05:38:56,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:38:56,023 INFO L231 Difference]: Finished difference. Result has 150 places, 147 transitions, 304 flow [2025-02-08 05:38:56,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=150, PETRI_TRANSITIONS=147} [2025-02-08 05:38:56,029 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -5 predicate places. [2025-02-08 05:38:56,030 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 147 transitions, 304 flow [2025-02-08 05:38:56,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:56,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1241956921, now seen corresponding path program 1 times [2025-02-08 05:38:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237723312] [2025-02-08 05:38:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:38:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:38:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237723312] [2025-02-08 05:38:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237723312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848012623] [2025-02-08 05:38:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2025-02-08 05:38:56,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2025-02-08 05:38:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,139 INFO L124 PetriNetUnfolderBase]: 11/188 cut-off events. [2025-02-08 05:38:56,140 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:38:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 188 events. 11/188 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 514 event pairs, 7 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2025-02-08 05:38:56,141 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 11 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-08 05:38:56,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 328 flow [2025-02-08 05:38:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-02-08 05:38:56,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103313840155945 [2025-02-08 05:38:56,143 INFO L175 Difference]: Start difference. First operand has 150 places, 147 transitions, 304 flow. Second operand 3 states and 467 transitions. [2025-02-08 05:38:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 328 flow [2025-02-08 05:38:56,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 146 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,146 INFO L231 Difference]: Finished difference. Result has 149 places, 146 transitions, 302 flow [2025-02-08 05:38:56,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=149, PETRI_TRANSITIONS=146} [2025-02-08 05:38:56,147 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -6 predicate places. [2025-02-08 05:38:56,147 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 146 transitions, 302 flow [2025-02-08 05:38:56,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,147 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] [2025-02-08 05:38:56,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:56,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 160400694, now seen corresponding path program 1 times [2025-02-08 05:38:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94446645] [2025-02-08 05:38:56,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:38:56,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:38:56,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94446645] [2025-02-08 05:38:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94446645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33584313] [2025-02-08 05:38:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-02-08 05:38:56,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-02-08 05:38:56,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,293 INFO L124 PetriNetUnfolderBase]: 30/404 cut-off events. [2025-02-08 05:38:56,293 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:38:56,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 404 events. 30/404 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2002 event pairs, 15 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 432. Up to 52 conditions per place. [2025-02-08 05:38:56,295 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-02-08 05:38:56,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 145 transitions, 328 flow [2025-02-08 05:38:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-02-08 05:38:56,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064327485380117 [2025-02-08 05:38:56,297 INFO L175 Difference]: Start difference. First operand has 149 places, 146 transitions, 302 flow. Second operand 3 states and 465 transitions. [2025-02-08 05:38:56,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 145 transitions, 328 flow [2025-02-08 05:38:56,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,299 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 300 flow [2025-02-08 05:38:56,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2025-02-08 05:38:56,300 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -7 predicate places. [2025-02-08 05:38:56,300 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 300 flow [2025-02-08 05:38:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,300 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-02-08 05:38:56,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:56,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 749919520, now seen corresponding path program 1 times [2025-02-08 05:38:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587065260] [2025-02-08 05:38:56,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:38:56,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:38:56,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587065260] [2025-02-08 05:38:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587065260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382197039] [2025-02-08 05:38:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2025-02-08 05:38:56,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2025-02-08 05:38:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,459 INFO L124 PetriNetUnfolderBase]: 97/835 cut-off events. [2025-02-08 05:38:56,459 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:38:56,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 835 events. 97/835 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5796 event pairs, 34 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 959. Up to 146 conditions per place. [2025-02-08 05:38:56,467 INFO L140 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-02-08 05:38:56,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 342 flow [2025-02-08 05:38:56,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-02-08 05:38:56,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2025-02-08 05:38:56,469 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 300 flow. Second operand 3 states and 471 transitions. [2025-02-08 05:38:56,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 342 flow [2025-02-08 05:38:56,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,473 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 311 flow [2025-02-08 05:38:56,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2025-02-08 05:38:56,474 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-02-08 05:38:56,475 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 311 flow [2025-02-08 05:38:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,475 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] [2025-02-08 05:38:56,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:56,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1567142565, now seen corresponding path program 1 times [2025-02-08 05:38:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420302340] [2025-02-08 05:38:56,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:38:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:38:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420302340] [2025-02-08 05:38:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420302340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246778278] [2025-02-08 05:38:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 145 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,611 INFO L124 PetriNetUnfolderBase]: 31/330 cut-off events. [2025-02-08 05:38:56,611 INFO L125 PetriNetUnfolderBase]: For 3/7 co-relation queries the response was YES. [2025-02-08 05:38:56,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 330 events. 31/330 cut-off events. For 3/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1395 event pairs, 4 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 259. Up to 32 conditions per place. [2025-02-08 05:38:56,613 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-02-08 05:38:56,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 145 transitions, 339 flow [2025-02-08 05:38:56,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,618 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 311 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 145 transitions, 339 flow [2025-02-08 05:38:56,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:56,620 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 313 flow [2025-02-08 05:38:56,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-02-08 05:38:56,621 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -9 predicate places. [2025-02-08 05:38:56,621 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 313 flow [2025-02-08 05:38:56,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,621 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] [2025-02-08 05:38:56,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:56,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1509526172, now seen corresponding path program 1 times [2025-02-08 05:38:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213056289] [2025-02-08 05:38:56,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:38:56,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:38:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213056289] [2025-02-08 05:38:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213056289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614326479] [2025-02-08 05:38:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,756 INFO L124 PetriNetUnfolderBase]: 71/676 cut-off events. [2025-02-08 05:38:56,757 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-02-08 05:38:56,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 676 events. 71/676 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3837 event pairs, 16 based on Foata normal form. 1/573 useless extension candidates. Maximal degree in co-relation 655. Up to 62 conditions per place. [2025-02-08 05:38:56,792 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 16 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-02-08 05:38:56,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 364 flow [2025-02-08 05:38:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-02-08 05:38:56,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2025-02-08 05:38:56,794 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 313 flow. Second operand 3 states and 479 transitions. [2025-02-08 05:38:56,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 364 flow [2025-02-08 05:38:56,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:56,796 INFO L231 Difference]: Finished difference. Result has 145 places, 143 transitions, 317 flow [2025-02-08 05:38:56,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=145, PETRI_TRANSITIONS=143} [2025-02-08 05:38:56,800 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-02-08 05:38:56,800 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 317 flow [2025-02-08 05:38:56,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:56,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1586080387, now seen corresponding path program 1 times [2025-02-08 05:38:56,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132135257] [2025-02-08 05:38:56,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:56,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:56,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132135257] [2025-02-08 05:38:56,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132135257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356481766] [2025-02-08 05:38:56,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:56,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][92], [Black: 193#true, 15#L42-6true, 195#(= |#race~a~0| 0), 36#L75-1true, 87#L50-6true, Black: 186#true, 188#(= |#race~c~0| 0), 197#true, 23#L58-6true]) [2025-02-08 05:38:56,896 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-02-08 05:38:56,896 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:56,896 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-08 05:38:56,896 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:38:56,903 INFO L124 PetriNetUnfolderBase]: 65/621 cut-off events. [2025-02-08 05:38:56,903 INFO L125 PetriNetUnfolderBase]: For 14/17 co-relation queries the response was YES. [2025-02-08 05:38:56,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 621 events. 65/621 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3450 event pairs, 12 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 570. Up to 55 conditions per place. [2025-02-08 05:38:56,908 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 10 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-02-08 05:38:56,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 143 transitions, 345 flow [2025-02-08 05:38:56,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:56,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:56,909 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 317 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:56,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 143 transitions, 345 flow [2025-02-08 05:38:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 143 transitions, 345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:56,911 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 319 flow [2025-02-08 05:38:56,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2025-02-08 05:38:56,912 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -10 predicate places. [2025-02-08 05:38:56,912 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 319 flow [2025-02-08 05:38:56,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:56,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:56,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1465031006, now seen corresponding path program 1 times [2025-02-08 05:38:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999503027] [2025-02-08 05:38:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:56,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:56,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999503027] [2025-02-08 05:38:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999503027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301590515] [2025-02-08 05:38:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:56,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:56,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:56,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:56,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:56,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:56,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:56,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,002 INFO L124 PetriNetUnfolderBase]: 49/486 cut-off events. [2025-02-08 05:38:57,003 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-02-08 05:38:57,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 486 events. 49/486 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2439 event pairs, 15 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 510. Up to 47 conditions per place. [2025-02-08 05:38:57,009 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-02-08 05:38:57,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 142 transitions, 351 flow [2025-02-08 05:38:57,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-02-08 05:38:57,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239766081871345 [2025-02-08 05:38:57,010 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 319 flow. Second operand 3 states and 474 transitions. [2025-02-08 05:38:57,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 142 transitions, 351 flow [2025-02-08 05:38:57,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,012 INFO L231 Difference]: Finished difference. Result has 144 places, 140 transitions, 315 flow [2025-02-08 05:38:57,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=144, PETRI_TRANSITIONS=140} [2025-02-08 05:38:57,013 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -11 predicate places. [2025-02-08 05:38:57,013 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 140 transitions, 315 flow [2025-02-08 05:38:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,013 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] [2025-02-08 05:38:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:57,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -490127100, now seen corresponding path program 1 times [2025-02-08 05:38:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693062721] [2025-02-08 05:38:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:38:57,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:38:57,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693062721] [2025-02-08 05:38:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693062721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499726235] [2025-02-08 05:38:57,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:57,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 140 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:57,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][90], [205#(= |#race~b~0| 0), 15#L42-6true, 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 36#L75-1true, Black: 186#true, 87#L50-6true, 188#(= |#race~c~0| 0), 23#L58-6true]) [2025-02-08 05:38:57,151 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,151 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,151 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:38:57,151 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][90], [205#(= |#race~b~0| 0), 200#true, Black: 193#true, 195#(= |#race~a~0| 0), 90#L77true, Black: 186#true, 87#L50-6true, 188#(= |#race~c~0| 0), 23#L58-6true]) [2025-02-08 05:38:57,156 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-02-08 05:38:57,156 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-02-08 05:38:57,156 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-02-08 05:38:57,156 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-08 05:38:57,156 INFO L124 PetriNetUnfolderBase]: 138/960 cut-off events. [2025-02-08 05:38:57,157 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-02-08 05:38:57,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 960 events. 138/960 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6624 event pairs, 21 based on Foata normal form. 1/846 useless extension candidates. Maximal degree in co-relation 990. Up to 143 conditions per place. [2025-02-08 05:38:57,162 INFO L140 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-02-08 05:38:57,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 361 flow [2025-02-08 05:38:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2025-02-08 05:38:57,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317738791423001 [2025-02-08 05:38:57,163 INFO L175 Difference]: Start difference. First operand has 144 places, 140 transitions, 315 flow. Second operand 3 states and 478 transitions. [2025-02-08 05:38:57,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 361 flow [2025-02-08 05:38:57,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 144 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,165 INFO L231 Difference]: Finished difference. Result has 143 places, 140 transitions, 321 flow [2025-02-08 05:38:57,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=143, PETRI_TRANSITIONS=140} [2025-02-08 05:38:57,166 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2025-02-08 05:38:57,166 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 140 transitions, 321 flow [2025-02-08 05:38:57,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:57,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:57,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash 613576443, now seen corresponding path program 1 times [2025-02-08 05:38:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115309368] [2025-02-08 05:38:57,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:57,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:57,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115309368] [2025-02-08 05:38:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115309368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213742722] [2025-02-08 05:38:57,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:57,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 140 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:57,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][90], [205#(= |#race~b~0| 0), Black: 193#true, 15#L42-6true, 195#(= |#race~a~0| 0), 207#true, 36#L75-1true, Black: 186#true, 87#L50-6true, Black: 203#true, 188#(= |#race~c~0| 0), 23#L58-6true]) [2025-02-08 05:38:57,272 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,272 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,272 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,272 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:38:57,276 INFO L124 PetriNetUnfolderBase]: 96/659 cut-off events. [2025-02-08 05:38:57,276 INFO L125 PetriNetUnfolderBase]: For 31/47 co-relation queries the response was YES. [2025-02-08 05:38:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 659 events. 96/659 cut-off events. For 31/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3971 event pairs, 14 based on Foata normal form. 6/611 useless extension candidates. Maximal degree in co-relation 671. Up to 70 conditions per place. [2025-02-08 05:38:57,280 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 8 selfloop transitions, 2 changer transitions 6/140 dead transitions. [2025-02-08 05:38:57,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 347 flow [2025-02-08 05:38:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-02-08 05:38:57,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9220272904483431 [2025-02-08 05:38:57,282 INFO L175 Difference]: Start difference. First operand has 143 places, 140 transitions, 321 flow. Second operand 3 states and 473 transitions. [2025-02-08 05:38:57,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 347 flow [2025-02-08 05:38:57,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:57,283 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 308 flow [2025-02-08 05:38:57,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2025-02-08 05:38:57,284 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -12 predicate places. [2025-02-08 05:38:57,284 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 308 flow [2025-02-08 05:38:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:57,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:57,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash -350416314, now seen corresponding path program 1 times [2025-02-08 05:38:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748696417] [2025-02-08 05:38:57,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:38:57,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:38:57,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748696417] [2025-02-08 05:38:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748696417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263607538] [2025-02-08 05:38:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:57,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][90], [205#(= |#race~b~0| 0), 15#L42-6true, Black: 193#true, 195#(= |#race~a~0| 0), 210#true, 207#true, 36#L75-1true, 87#L50-6true, Black: 186#true, 188#(= |#race~c~0| 0), Black: 203#true, 23#L58-6true]) [2025-02-08 05:38:57,377 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,377 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,377 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:38:57,377 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,384 INFO L124 PetriNetUnfolderBase]: 117/824 cut-off events. [2025-02-08 05:38:57,384 INFO L125 PetriNetUnfolderBase]: For 26/30 co-relation queries the response was YES. [2025-02-08 05:38:57,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 824 events. 117/824 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5223 event pairs, 40 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 861. Up to 84 conditions per place. [2025-02-08 05:38:57,391 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 10 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-02-08 05:38:57,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 336 flow [2025-02-08 05:38:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-02-08 05:38:57,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2025-02-08 05:38:57,392 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 308 flow. Second operand 3 states and 472 transitions. [2025-02-08 05:38:57,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 336 flow [2025-02-08 05:38:57,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,394 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 306 flow [2025-02-08 05:38:57,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2025-02-08 05:38:57,395 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -19 predicate places. [2025-02-08 05:38:57,395 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 306 flow [2025-02-08 05:38:57,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:57,395 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-02-08 05:38:57,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:57,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:57,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -715901281, now seen corresponding path program 1 times [2025-02-08 05:38:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609735214] [2025-02-08 05:38:57,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:57,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:38:57,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:38:57,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:57,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609735214] [2025-02-08 05:38:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609735214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285845338] [2025-02-08 05:38:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:57,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 171 [2025-02-08 05:38:57,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:57,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 171 [2025-02-08 05:38:57,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:57,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L58-1-->L58-6: Formula: (= |v_#race~c~0_9| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_9|} AuxVars[] AssignedVars[#race~c~0][90], [205#(= |#race~b~0| 0), Black: 193#true, 15#L42-6true, 195#(= |#race~a~0| 0), 210#true, 213#true, 36#L75-1true, Black: 186#true, 87#L50-6true, Black: 203#true, 188#(= |#race~c~0| 0), 23#L58-6true]) [2025-02-08 05:38:57,490 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,491 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-02-08 05:38:57,491 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-02-08 05:38:57,491 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-08 05:38:57,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L59-3-->L59-2: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5][122], [106#L59-2true, 205#(= |#race~b~0| 0), Black: 193#true, 195#(= |#race~a~0| 0), 28#L78true, 210#true, 213#true, Black: 186#true, Black: 203#true, 188#(= |#race~c~0| 0)]) [2025-02-08 05:38:57,494 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-02-08 05:38:57,494 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-02-08 05:38:57,494 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-02-08 05:38:57,494 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-02-08 05:38:57,494 INFO L124 PetriNetUnfolderBase]: 106/653 cut-off events. [2025-02-08 05:38:57,494 INFO L125 PetriNetUnfolderBase]: For 37/61 co-relation queries the response was YES. [2025-02-08 05:38:57,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 653 events. 106/653 cut-off events. For 37/61 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3874 event pairs, 29 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 783. Up to 85 conditions per place. [2025-02-08 05:38:57,496 INFO L140 encePairwiseOnDemand]: 168/171 looper letters, 0 selfloop transitions, 0 changer transitions 132/132 dead transitions. [2025-02-08 05:38:57,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 132 transitions, 334 flow [2025-02-08 05:38:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-02-08 05:38:57,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9200779727095516 [2025-02-08 05:38:57,498 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 306 flow. Second operand 3 states and 472 transitions. [2025-02-08 05:38:57,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 132 transitions, 334 flow [2025-02-08 05:38:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:57,499 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-02-08 05:38:57,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-02-08 05:38:57,500 INFO L279 CegarLoopForPetriNet]: 155 programPoint places, -20 predicate places. [2025-02-08 05:38:57,500 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-02-08 05:38:57,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:38:57,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:38:57,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:38:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:57,504 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:57,507 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:57,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:57,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:57 BasicIcfg [2025-02-08 05:38:57,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:57,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:57,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:57,511 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:57,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:55" (3/4) ... [2025-02-08 05:38:57,512 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:57,515 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:57,515 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:57,515 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:38:57,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-08 05:38:57,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:57,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:57,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:57,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:57,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:57,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:57,567 INFO L158 Benchmark]: Toolchain (without parser) took 2762.18ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 149.9MB in the end (delta: 8.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,567 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 209.7MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.06ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.57ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,567 INFO L158 Benchmark]: Boogie Preprocessor took 26.78ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.8MB in the end (delta: 810.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:57,568 INFO L158 Benchmark]: IcfgBuilder took 383.81ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 128.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,568 INFO L158 Benchmark]: TraceAbstraction took 2077.54ms. Allocated memory is still 201.3MB. Free memory was 127.5MB in the beginning and 156.3MB in the end (delta: -28.9MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,568 INFO L158 Benchmark]: Witness Printer took 55.42ms. Allocated memory is still 201.3MB. Free memory was 156.3MB in the beginning and 149.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:57,569 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.19ms. Allocated memory is still 209.7MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.06ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 146.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.57ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.78ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.8MB in the end (delta: 810.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 383.81ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 128.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2077.54ms. Allocated memory is still 201.3MB. Free memory was 127.5MB in the beginning and 156.3MB in the end (delta: -28.9MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Witness Printer took 55.42ms. Allocated memory is still 201.3MB. Free memory was 156.3MB in the beginning and 149.9MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 59]: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 246 locations, 35 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 76 mSDtfsCounter, 335 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=321occurred in iteration=9, 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, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:57,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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