./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:34:45,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:34:45,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:34:45,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:34:45,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:34:45,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:34:45,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:34:45,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:34:45,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:34:45,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:34:45,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:34:45,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:34:45,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:45,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:34:45,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:34:45,583 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2025-02-06 09:34:45,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:34:45,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:34:45,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:34:45,790 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:34:45,790 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:34:45,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2025-02-06 09:34:46,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e227f8ee/4254086d93e6478db75e7e3c7e409a80/FLAG888628947 [2025-02-06 09:34:47,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:34:47,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2025-02-06 09:34:47,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e227f8ee/4254086d93e6478db75e7e3c7e409a80/FLAG888628947 [2025-02-06 09:34:47,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e227f8ee/4254086d93e6478db75e7e3c7e409a80 [2025-02-06 09:34:47,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:34:47,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:34:47,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:47,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:34:47,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:34:47,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:47" (1/1) ... [2025-02-06 09:34:47,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6745e73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:47, skipping insertion in model container [2025-02-06 09:34:47,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:47" (1/1) ... [2025-02-06 09:34:47,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:34:47,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:47,961 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:34:48,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:48,039 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:34:48,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48 WrapperNode [2025-02-06 09:34:48,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:48,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:48,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:34:48,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:34:48,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,068 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-02-06 09:34:48,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:48,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:34:48,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:34:48,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:34:48,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:34:48,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:34:48,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:34:48,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:34:48,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (1/1) ... [2025-02-06 09:34:48,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:34:48,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:34:48,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:34:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:34:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:34:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:34:48,148 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:34:48,228 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:34:48,230 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:34:48,420 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:34:48,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:34:48,429 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:34:48,432 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:34:48,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:48 BoogieIcfgContainer [2025-02-06 09:34:48,432 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:34:48,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:34:48,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:34:48,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:34:48,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:34:47" (1/3) ... [2025-02-06 09:34:48,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dbe3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:48, skipping insertion in model container [2025-02-06 09:34:48,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:48" (2/3) ... [2025-02-06 09:34:48,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dbe3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:48, skipping insertion in model container [2025-02-06 09:34:48,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:48" (3/3) ... [2025-02-06 09:34:48,441 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2025-02-06 09:34:48,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:34:48,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-ptr.i that has 2 procedures, 80 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-02-06 09:34:48,455 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:34:48,511 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:34:48,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 171 flow [2025-02-06 09:34:48,589 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2025-02-06 09:34:48,591 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:34:48,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 112 events. 2/112 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-02-06 09:34:48,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 171 flow [2025-02-06 09:34:48,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 171 flow [2025-02-06 09:34:48,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:34:48,610 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;@1800af25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:34:48,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 09:34:48,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:34:48,621 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-02-06 09:34:48,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:34:48,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:48,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:48,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:34:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1473435858, now seen corresponding path program 1 times [2025-02-06 09:34:48,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:48,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81644036] [2025-02-06 09:34:48,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:48,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:34:48,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:34:48,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:49,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81644036] [2025-02-06 09:34:49,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81644036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:49,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:49,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242048933] [2025-02-06 09:34:49,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:49,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:49,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:49,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:49,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 82 [2025-02-06 09:34:49,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:49,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:49,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 82 [2025-02-06 09:34:49,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:49,501 INFO L124 PetriNetUnfolderBase]: 71/365 cut-off events. [2025-02-06 09:34:49,501 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:34:49,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 365 events. 71/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1788 event pairs, 32 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 471. Up to 151 conditions per place. [2025-02-06 09:34:49,504 INFO L140 encePairwiseOnDemand]: 70/82 looper letters, 23 selfloop transitions, 22 changer transitions 1/102 dead transitions. [2025-02-06 09:34:49,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 102 transitions, 301 flow [2025-02-06 09:34:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 389 transitions. [2025-02-06 09:34:49,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.790650406504065 [2025-02-06 09:34:49,513 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 171 flow. Second operand 6 states and 389 transitions. [2025-02-06 09:34:49,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 102 transitions, 301 flow [2025-02-06 09:34:49,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 102 transitions, 301 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:49,519 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 317 flow [2025-02-06 09:34:49,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2025-02-06 09:34:49,523 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2025-02-06 09:34:49,523 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 317 flow [2025-02-06 09:34:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:49,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:49,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:34:49,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:34:49,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 359583505, now seen corresponding path program 1 times [2025-02-06 09:34:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:49,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504412766] [2025-02-06 09:34:49,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:49,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:34:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:34:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504412766] [2025-02-06 09:34:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504412766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497469728] [2025-02-06 09:34:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:49,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:34:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:49,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:34:49,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:34:49,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 82 [2025-02-06 09:34:49,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:49,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:49,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 82 [2025-02-06 09:34:49,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:49,757 INFO L124 PetriNetUnfolderBase]: 33/235 cut-off events. [2025-02-06 09:34:49,757 INFO L125 PetriNetUnfolderBase]: For 28/35 co-relation queries the response was YES. [2025-02-06 09:34:49,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 235 events. 33/235 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 773 event pairs, 0 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 310. Up to 45 conditions per place. [2025-02-06 09:34:49,760 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 11 selfloop transitions, 2 changer transitions 5/106 dead transitions. [2025-02-06 09:34:49,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 106 transitions, 363 flow [2025-02-06 09:34:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2025-02-06 09:34:49,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8678861788617886 [2025-02-06 09:34:49,766 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 317 flow. Second operand 6 states and 427 transitions. [2025-02-06 09:34:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 106 transitions, 363 flow [2025-02-06 09:34:49,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 106 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:49,770 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 335 flow [2025-02-06 09:34:49,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2025-02-06 09:34:49,771 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2025-02-06 09:34:49,771 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 335 flow [2025-02-06 09:34:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:49,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:49,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:34:49,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:34:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -69193246, now seen corresponding path program 1 times [2025-02-06 09:34:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022378259] [2025-02-06 09:34:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:34:49,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:34:49,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:49,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:50,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:50,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:50,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022378259] [2025-02-06 09:34:50,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022378259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974319149] [2025-02-06 09:34:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:50,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:50,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:50,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 82 [2025-02-06 09:34:50,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:50,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:50,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 82 [2025-02-06 09:34:50,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:50,271 INFO L124 PetriNetUnfolderBase]: 130/477 cut-off events. [2025-02-06 09:34:50,271 INFO L125 PetriNetUnfolderBase]: For 139/151 co-relation queries the response was YES. [2025-02-06 09:34:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 477 events. 130/477 cut-off events. For 139/151 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2457 event pairs, 23 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 992. Up to 238 conditions per place. [2025-02-06 09:34:50,274 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 33 selfloop transitions, 48 changer transitions 8/144 dead transitions. [2025-02-06 09:34:50,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 653 flow [2025-02-06 09:34:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 429 transitions. [2025-02-06 09:34:50,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8719512195121951 [2025-02-06 09:34:50,275 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 335 flow. Second operand 6 states and 429 transitions. [2025-02-06 09:34:50,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 653 flow [2025-02-06 09:34:50,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 639 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 09:34:50,280 INFO L231 Difference]: Finished difference. Result has 103 places, 136 transitions, 693 flow [2025-02-06 09:34:50,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=103, PETRI_TRANSITIONS=136} [2025-02-06 09:34:50,280 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 20 predicate places. [2025-02-06 09:34:50,280 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 136 transitions, 693 flow [2025-02-06 09:34:50,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:50,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:50,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:34:50,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:34:50,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash -180022510, now seen corresponding path program 1 times [2025-02-06 09:34:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883219313] [2025-02-06 09:34:50,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:34:50,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:34:50,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:50,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883219313] [2025-02-06 09:34:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883219313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:50,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743519091] [2025-02-06 09:34:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:50,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:50,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:50,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 82 [2025-02-06 09:34:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 136 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:50,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 82 [2025-02-06 09:34:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:50,795 INFO L124 PetriNetUnfolderBase]: 142/505 cut-off events. [2025-02-06 09:34:50,795 INFO L125 PetriNetUnfolderBase]: For 466/490 co-relation queries the response was YES. [2025-02-06 09:34:50,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 505 events. 142/505 cut-off events. For 466/490 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2817 event pairs, 10 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 1464. Up to 241 conditions per place. [2025-02-06 09:34:50,798 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 73 selfloop transitions, 25 changer transitions 13/164 dead transitions. [2025-02-06 09:34:50,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 164 transitions, 1076 flow [2025-02-06 09:34:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-02-06 09:34:50,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.806910569105691 [2025-02-06 09:34:50,800 INFO L175 Difference]: Start difference. First operand has 103 places, 136 transitions, 693 flow. Second operand 6 states and 397 transitions. [2025-02-06 09:34:50,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 164 transitions, 1076 flow [2025-02-06 09:34:50,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 164 transitions, 1058 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:50,808 INFO L231 Difference]: Finished difference. Result has 105 places, 151 transitions, 910 flow [2025-02-06 09:34:50,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=105, PETRI_TRANSITIONS=151} [2025-02-06 09:34:50,809 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 22 predicate places. [2025-02-06 09:34:50,809 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 151 transitions, 910 flow [2025-02-06 09:34:50,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:50,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:50,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:50,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:34:50,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-06 09:34:50,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2020211525, now seen corresponding path program 1 times [2025-02-06 09:34:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808937226] [2025-02-06 09:34:50,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:34:50,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:34:50,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:50,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:34:50,830 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:34:50,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 09:34:50,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 09:34:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:34:50,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:34:50,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:34:50,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 09:34:50,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-02-06 09:34:50,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-02-06 09:34:50,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-02-06 09:34:50,869 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-02-06 09:34:50,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:34:50,869 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:34:50,871 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:34:50,871 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:34:50,903 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:34:50,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 100 transitions, 216 flow [2025-02-06 09:34:50,921 INFO L124 PetriNetUnfolderBase]: 4/192 cut-off events. [2025-02-06 09:34:50,922 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:34:50,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 4/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 420 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2025-02-06 09:34:50,922 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 100 transitions, 216 flow [2025-02-06 09:34:50,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 216 flow [2025-02-06 09:34:50,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:34:50,927 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;@1800af25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:34:50,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 09:34:50,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:34:50,930 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-02-06 09:34:50,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:34:50,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:50,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:50,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash 416152594, now seen corresponding path program 1 times [2025-02-06 09:34:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549313961] [2025-02-06 09:34:50,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:50,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:34:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:34:50,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:50,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549313961] [2025-02-06 09:34:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549313961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:51,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291107414] [2025-02-06 09:34:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:51,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:51,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:51,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-02-06 09:34:51,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:51,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-02-06 09:34:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:51,474 INFO L124 PetriNetUnfolderBase]: 903/2672 cut-off events. [2025-02-06 09:34:51,475 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 09:34:51,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 2672 events. 903/2672 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 20571 event pairs, 529 based on Foata normal form. 1/2404 useless extension candidates. Maximal degree in co-relation 2356. Up to 1385 conditions per place. [2025-02-06 09:34:51,485 INFO L140 encePairwiseOnDemand]: 84/100 looper letters, 30 selfloop transitions, 38 changer transitions 1/137 dead transitions. [2025-02-06 09:34:51,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 431 flow [2025-02-06 09:34:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-02-06 09:34:51,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8066666666666666 [2025-02-06 09:34:51,487 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 216 flow. Second operand 6 states and 484 transitions. [2025-02-06 09:34:51,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 431 flow [2025-02-06 09:34:51,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:51,489 INFO L231 Difference]: Finished difference. Result has 112 places, 135 transitions, 466 flow [2025-02-06 09:34:51,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=112, PETRI_TRANSITIONS=135} [2025-02-06 09:34:51,490 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2025-02-06 09:34:51,490 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 135 transitions, 466 flow [2025-02-06 09:34:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:51,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:51,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:51,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:34:51,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2045795339, now seen corresponding path program 1 times [2025-02-06 09:34:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134456495] [2025-02-06 09:34:51,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:51,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:34:51,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:34:51,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134456495] [2025-02-06 09:34:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134456495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155444043] [2025-02-06 09:34:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:51,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:34:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:51,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:34:51,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:34:51,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 100 [2025-02-06 09:34:51,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:51,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:51,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 100 [2025-02-06 09:34:51,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:51,713 INFO L124 PetriNetUnfolderBase]: 423/1467 cut-off events. [2025-02-06 09:34:51,713 INFO L125 PetriNetUnfolderBase]: For 333/397 co-relation queries the response was YES. [2025-02-06 09:34:51,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 1467 events. 423/1467 cut-off events. For 333/397 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9736 event pairs, 116 based on Foata normal form. 2/1393 useless extension candidates. Maximal degree in co-relation 2171. Up to 520 conditions per place. [2025-02-06 09:34:51,720 INFO L140 encePairwiseOnDemand]: 92/100 looper letters, 14 selfloop transitions, 2 changer transitions 5/141 dead transitions. [2025-02-06 09:34:51,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 520 flow [2025-02-06 09:34:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2025-02-06 09:34:51,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8766666666666667 [2025-02-06 09:34:51,722 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 466 flow. Second operand 6 states and 526 transitions. [2025-02-06 09:34:51,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 520 flow [2025-02-06 09:34:51,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 141 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:51,726 INFO L231 Difference]: Finished difference. Result has 120 places, 136 transitions, 488 flow [2025-02-06 09:34:51,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=120, PETRI_TRANSITIONS=136} [2025-02-06 09:34:51,726 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2025-02-06 09:34:51,726 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 136 transitions, 488 flow [2025-02-06 09:34:51,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:51,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:51,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:51,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:34:51,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1443795382, now seen corresponding path program 1 times [2025-02-06 09:34:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103546064] [2025-02-06 09:34:51,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:51,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:34:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:34:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103546064] [2025-02-06 09:34:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103546064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709425673] [2025-02-06 09:34:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:51,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 100 [2025-02-06 09:34:51,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 136 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:51,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:51,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 100 [2025-02-06 09:34:51,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:52,504 INFO L124 PetriNetUnfolderBase]: 1867/4616 cut-off events. [2025-02-06 09:34:52,505 INFO L125 PetriNetUnfolderBase]: For 1536/1608 co-relation queries the response was YES. [2025-02-06 09:34:52,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10873 conditions, 4616 events. 1867/4616 cut-off events. For 1536/1608 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 36319 event pairs, 439 based on Foata normal form. 0/4334 useless extension candidates. Maximal degree in co-relation 10779. Up to 2583 conditions per place. [2025-02-06 09:34:52,533 INFO L140 encePairwiseOnDemand]: 81/100 looper letters, 63 selfloop transitions, 92 changer transitions 0/231 dead transitions. [2025-02-06 09:34:52,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 231 transitions, 1234 flow [2025-02-06 09:34:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-02-06 09:34:52,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-02-06 09:34:52,537 INFO L175 Difference]: Start difference. First operand has 120 places, 136 transitions, 488 flow. Second operand 6 states and 531 transitions. [2025-02-06 09:34:52,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 231 transitions, 1234 flow [2025-02-06 09:34:52,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 231 transitions, 1222 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-06 09:34:52,547 INFO L231 Difference]: Finished difference. Result has 123 places, 223 transitions, 1312 flow [2025-02-06 09:34:52,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=123, PETRI_TRANSITIONS=223} [2025-02-06 09:34:52,548 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2025-02-06 09:34:52,551 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 223 transitions, 1312 flow [2025-02-06 09:34:52,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:52,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:52,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:52,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:34:52,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:52,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1403887394, now seen corresponding path program 1 times [2025-02-06 09:34:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365412326] [2025-02-06 09:34:52,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:52,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:34:52,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:34:52,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:52,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:52,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:52,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365412326] [2025-02-06 09:34:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365412326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:52,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:52,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361694223] [2025-02-06 09:34:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:52,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:52,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:52,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:52,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 100 [2025-02-06 09:34:52,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 223 transitions, 1312 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:52,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:52,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 100 [2025-02-06 09:34:52,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:53,325 INFO L124 PetriNetUnfolderBase]: 2323/5522 cut-off events. [2025-02-06 09:34:53,325 INFO L125 PetriNetUnfolderBase]: For 5298/5505 co-relation queries the response was YES. [2025-02-06 09:34:53,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17444 conditions, 5522 events. 2323/5522 cut-off events. For 5298/5505 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 44280 event pairs, 290 based on Foata normal form. 2/5293 useless extension candidates. Maximal degree in co-relation 13989. Up to 3131 conditions per place. [2025-02-06 09:34:53,359 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 145 selfloop transitions, 76 changer transitions 0/296 dead transitions. [2025-02-06 09:34:53,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 296 transitions, 2246 flow [2025-02-06 09:34:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-06 09:34:53,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2025-02-06 09:34:53,361 INFO L175 Difference]: Start difference. First operand has 123 places, 223 transitions, 1312 flow. Second operand 6 states and 494 transitions. [2025-02-06 09:34:53,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 296 transitions, 2246 flow [2025-02-06 09:34:53,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 296 transitions, 2228 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:53,384 INFO L231 Difference]: Finished difference. Result has 133 places, 294 transitions, 2152 flow [2025-02-06 09:34:53,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2152, PETRI_PLACES=133, PETRI_TRANSITIONS=294} [2025-02-06 09:34:53,386 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2025-02-06 09:34:53,386 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 294 transitions, 2152 flow [2025-02-06 09:34:53,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:53,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:53,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:53,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:34:53,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1236453631, now seen corresponding path program 1 times [2025-02-06 09:34:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690183316] [2025-02-06 09:34:53,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:34:53,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:34:53,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:53,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690183316] [2025-02-06 09:34:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690183316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:34:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096270102] [2025-02-06 09:34:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:34:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:53,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:34:53,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:34:54,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-02-06 09:34:54,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 294 transitions, 2152 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:54,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:54,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-02-06 09:34:54,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:55,560 INFO L124 PetriNetUnfolderBase]: 3597/8563 cut-off events. [2025-02-06 09:34:55,563 INFO L125 PetriNetUnfolderBase]: For 14424/14711 co-relation queries the response was YES. [2025-02-06 09:34:55,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29987 conditions, 8563 events. 3597/8563 cut-off events. For 14424/14711 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 74320 event pairs, 99 based on Foata normal form. 148/8497 useless extension candidates. Maximal degree in co-relation 25895. Up to 3354 conditions per place. [2025-02-06 09:34:55,654 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 397 selfloop transitions, 188 changer transitions 0/648 dead transitions. [2025-02-06 09:34:55,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 648 transitions, 6238 flow [2025-02-06 09:34:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:34:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:34:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1429 transitions. [2025-02-06 09:34:55,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804761904761905 [2025-02-06 09:34:55,658 INFO L175 Difference]: Start difference. First operand has 133 places, 294 transitions, 2152 flow. Second operand 21 states and 1429 transitions. [2025-02-06 09:34:55,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 648 transitions, 6238 flow [2025-02-06 09:34:55,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 648 transitions, 6030 flow, removed 104 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:55,712 INFO L231 Difference]: Finished difference. Result has 160 places, 469 transitions, 4417 flow [2025-02-06 09:34:55,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4417, PETRI_PLACES=160, PETRI_TRANSITIONS=469} [2025-02-06 09:34:55,713 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 58 predicate places. [2025-02-06 09:34:55,713 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 469 transitions, 4417 flow [2025-02-06 09:34:55,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:55,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:55,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:34:55,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:55,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1681987694, now seen corresponding path program 1 times [2025-02-06 09:34:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:55,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803636819] [2025-02-06 09:34:55,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:55,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:34:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:34:55,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:55,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:56,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803636819] [2025-02-06 09:34:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803636819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:34:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502272440] [2025-02-06 09:34:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:34:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:56,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:34:56,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:34:56,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 100 [2025-02-06 09:34:56,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 469 transitions, 4417 flow. Second operand has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:56,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:56,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 100 [2025-02-06 09:34:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:58,261 INFO L124 PetriNetUnfolderBase]: 4396/9613 cut-off events. [2025-02-06 09:34:58,262 INFO L125 PetriNetUnfolderBase]: For 32510/33351 co-relation queries the response was YES. [2025-02-06 09:34:58,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42072 conditions, 9613 events. 4396/9613 cut-off events. For 32510/33351 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80457 event pairs, 223 based on Foata normal form. 277/9675 useless extension candidates. Maximal degree in co-relation 37378. Up to 3548 conditions per place. [2025-02-06 09:34:58,320 INFO L140 encePairwiseOnDemand]: 78/100 looper letters, 420 selfloop transitions, 454 changer transitions 1/952 dead transitions. [2025-02-06 09:34:58,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 952 transitions, 10899 flow [2025-02-06 09:34:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:34:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-06 09:34:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1662 transitions. [2025-02-06 09:34:58,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7226086956521739 [2025-02-06 09:34:58,327 INFO L175 Difference]: Start difference. First operand has 160 places, 469 transitions, 4417 flow. Second operand 23 states and 1662 transitions. [2025-02-06 09:34:58,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 952 transitions, 10899 flow [2025-02-06 09:34:58,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 952 transitions, 10871 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 09:34:58,415 INFO L231 Difference]: Finished difference. Result has 188 places, 775 transitions, 9573 flow [2025-02-06 09:34:58,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=4389, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9573, PETRI_PLACES=188, PETRI_TRANSITIONS=775} [2025-02-06 09:34:58,417 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 86 predicate places. [2025-02-06 09:34:58,417 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 775 transitions, 9573 flow [2025-02-06 09:34:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 64.5) internal successors, (903), 14 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:58,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:58,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:34:58,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:34:58,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:34:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1174071971, now seen corresponding path program 2 times [2025-02-06 09:34:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190568970] [2025-02-06 09:34:58,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:34:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:58,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:34:58,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:34:58,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:34:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:58,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:58,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190568970] [2025-02-06 09:34:58,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190568970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:58,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 09:34:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081557876] [2025-02-06 09:34:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:58,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:34:58,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:58,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:34:58,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:34:59,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 100 [2025-02-06 09:34:59,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 775 transitions, 9573 flow. Second operand has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:34:59,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:59,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 100 [2025-02-06 09:34:59,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:01,166 INFO L124 PetriNetUnfolderBase]: 4592/10419 cut-off events. [2025-02-06 09:35:01,166 INFO L125 PetriNetUnfolderBase]: For 74512/75333 co-relation queries the response was YES. [2025-02-06 09:35:01,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55801 conditions, 10419 events. 4592/10419 cut-off events. For 74512/75333 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 89122 event pairs, 323 based on Foata normal form. 247/10336 useless extension candidates. Maximal degree in co-relation 54667. Up to 5268 conditions per place. [2025-02-06 09:35:01,240 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 590 selfloop transitions, 281 changer transitions 0/943 dead transitions. [2025-02-06 09:35:01,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 943 transitions, 13592 flow [2025-02-06 09:35:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 09:35:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-02-06 09:35:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1292 transitions. [2025-02-06 09:35:01,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-06 09:35:01,243 INFO L175 Difference]: Start difference. First operand has 188 places, 775 transitions, 9573 flow. Second operand 19 states and 1292 transitions. [2025-02-06 09:35:01,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 943 transitions, 13592 flow [2025-02-06 09:35:01,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 943 transitions, 13358 flow, removed 102 selfloop flow, removed 9 redundant places. [2025-02-06 09:35:01,482 INFO L231 Difference]: Finished difference. Result has 203 places, 872 transitions, 12016 flow [2025-02-06 09:35:01,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=9339, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12016, PETRI_PLACES=203, PETRI_TRANSITIONS=872} [2025-02-06 09:35:01,483 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 101 predicate places. [2025-02-06 09:35:01,483 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 872 transitions, 12016 flow [2025-02-06 09:35:01,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.857142857142854) internal successors, (866), 14 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:01,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:01,483 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:01,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:35:01,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:01,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1679132141, now seen corresponding path program 3 times [2025-02-06 09:35:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:01,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083664203] [2025-02-06 09:35:01,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:35:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:01,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:35:01,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:01,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:35:01,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083664203] [2025-02-06 09:35:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083664203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:35:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987970059] [2025-02-06 09:35:01,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:35:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:01,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:35:01,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:35:01,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:35:01,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:01,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:35:01,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:01,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 09:35:01,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:35:02,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:35:02,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:35:02,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 09:35:02,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 09:35:02,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:35:02,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:35:02,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:35:02,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2025-02-06 09:35:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:02,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:35:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987970059] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:35:04,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:35:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-02-06 09:35:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693897030] [2025-02-06 09:35:04,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:35:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-06 09:35:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:04,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-06 09:35:04,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1449, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 09:35:12,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:16,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:16,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 100 [2025-02-06 09:35:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 872 transitions, 12016 flow. Second operand has 41 states, 41 states have (on average 58.1219512195122) internal successors, (2383), 41 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:16,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 100 [2025-02-06 09:35:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:22,483 INFO L124 PetriNetUnfolderBase]: 9507/20990 cut-off events. [2025-02-06 09:35:22,483 INFO L125 PetriNetUnfolderBase]: For 191836/194963 co-relation queries the response was YES. [2025-02-06 09:35:22,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125012 conditions, 20990 events. 9507/20990 cut-off events. For 191836/194963 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 200510 event pairs, 705 based on Foata normal form. 1104/21498 useless extension candidates. Maximal degree in co-relation 123412. Up to 7760 conditions per place. [2025-02-06 09:35:22,841 INFO L140 encePairwiseOnDemand]: 70/100 looper letters, 993 selfloop transitions, 1118 changer transitions 0/2179 dead transitions. [2025-02-06 09:35:22,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 2179 transitions, 38446 flow [2025-02-06 09:35:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 09:35:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-02-06 09:35:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2203 transitions. [2025-02-06 09:35:22,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479411764705882 [2025-02-06 09:35:22,844 INFO L175 Difference]: Start difference. First operand has 203 places, 872 transitions, 12016 flow. Second operand 34 states and 2203 transitions. [2025-02-06 09:35:22,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 2179 transitions, 38446 flow [2025-02-06 09:35:23,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 2179 transitions, 38194 flow, removed 96 selfloop flow, removed 12 redundant places. [2025-02-06 09:35:23,456 INFO L231 Difference]: Finished difference. Result has 239 places, 1801 transitions, 33249 flow [2025-02-06 09:35:23,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=11880, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=33249, PETRI_PLACES=239, PETRI_TRANSITIONS=1801} [2025-02-06 09:35:23,457 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 137 predicate places. [2025-02-06 09:35:23,457 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 1801 transitions, 33249 flow [2025-02-06 09:35:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 58.1219512195122) internal successors, (2383), 41 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:23,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:23,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:23,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:35:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 09:35:23,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1133771627, now seen corresponding path program 4 times [2025-02-06 09:35:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776089909] [2025-02-06 09:35:23,664 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:35:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:23,673 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:35:23,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:23,683 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:35:23,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:23,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776089909] [2025-02-06 09:35:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776089909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:35:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732033487] [2025-02-06 09:35:23,940 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:35:23,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:23,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:23,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:35:23,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:35:23,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-02-06 09:35:24,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:24,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:35:24,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:24,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:35:24,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:35:24,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:35:24,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:35:24,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 09:35:24,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 09:35:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:35:24,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:24,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:35:24,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:24,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:35:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-02-06 09:35:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:24,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:35:24,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_379 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))))) is different from false [2025-02-06 09:35:24,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)))) (forall ((v_ArrVal_379 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)))))))) is different from false [2025-02-06 09:35:28,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) (.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)))) (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_379 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_379) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:35:28,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:28,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-02-06 09:35:28,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:28,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2025-02-06 09:35:28,036 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:28,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:28,041 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:28,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:28,046 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:28,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732033487] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:35:28,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:35:28,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-02-06 09:35:28,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438379370] [2025-02-06 09:35:28,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:35:28,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 09:35:28,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:28,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 09:35:28,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=244, Unknown=22, NotChecked=102, Total=420 [2025-02-06 09:35:28,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-02-06 09:35:28,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 1801 transitions, 33249 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:28,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:28,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-02-06 09:35:28,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:37,512 INFO L124 PetriNetUnfolderBase]: 16677/35756 cut-off events. [2025-02-06 09:35:37,512 INFO L125 PetriNetUnfolderBase]: For 370920/374069 co-relation queries the response was YES. [2025-02-06 09:35:37,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206242 conditions, 35756 events. 16677/35756 cut-off events. For 370920/374069 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 365366 event pairs, 3635 based on Foata normal form. 750/34753 useless extension candidates. Maximal degree in co-relation 203865. Up to 20463 conditions per place. [2025-02-06 09:35:38,168 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 1144 selfloop transitions, 1017 changer transitions 1/2216 dead transitions. [2025-02-06 09:35:38,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 2216 transitions, 45005 flow [2025-02-06 09:35:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 09:35:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 09:35:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1167 transitions. [2025-02-06 09:35:38,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5835 [2025-02-06 09:35:38,175 INFO L175 Difference]: Start difference. First operand has 239 places, 1801 transitions, 33249 flow. Second operand 20 states and 1167 transitions. [2025-02-06 09:35:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 2216 transitions, 45005 flow [2025-02-06 09:35:40,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2216 transitions, 43002 flow, removed 971 selfloop flow, removed 11 redundant places. [2025-02-06 09:35:40,083 INFO L231 Difference]: Finished difference. Result has 252 places, 2090 transitions, 41803 flow [2025-02-06 09:35:40,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=31494, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=768, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=915, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=41803, PETRI_PLACES=252, PETRI_TRANSITIONS=2090} [2025-02-06 09:35:40,085 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 150 predicate places. [2025-02-06 09:35:40,086 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 2090 transitions, 41803 flow [2025-02-06 09:35:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:40,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:40,086 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:40,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:35:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:40,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:40,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash 774141789, now seen corresponding path program 5 times [2025-02-06 09:35:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948112094] [2025-02-06 09:35:40,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:35:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:40,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:35:40,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:40,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 09:35:40,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948112094] [2025-02-06 09:35:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948112094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:35:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564280022] [2025-02-06 09:35:40,757 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:35:40,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:40,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:35:40,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:35:40,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:35:40,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:40,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-06 09:35:40,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:40,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:35:40,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:35:40,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:35:40,888 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:35:40,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 09:35:40,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 09:35:40,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:35:40,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:40,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:35:40,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:40,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:35:41,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-02-06 09:35:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:41,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:35:41,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:35:41,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:35:43,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_442 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)))) (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_442) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:35:43,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:43,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-02-06 09:35:43,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:43,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2025-02-06 09:35:43,188 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:43,198 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:43,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:43,204 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:35:43,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:35:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564280022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:35:43,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:35:43,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-02-06 09:35:43,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555365551] [2025-02-06 09:35:43,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:35:43,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 09:35:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:43,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 09:35:43,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=241, Unknown=26, NotChecked=102, Total=420 [2025-02-06 09:35:43,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-02-06 09:35:43,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 2090 transitions, 41803 flow. Second operand has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:43,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:43,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-02-06 09:35:43,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:54,365 INFO L124 PetriNetUnfolderBase]: 16723/36043 cut-off events. [2025-02-06 09:35:54,365 INFO L125 PetriNetUnfolderBase]: For 404710/410476 co-relation queries the response was YES. [2025-02-06 09:35:54,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216996 conditions, 36043 events. 16723/36043 cut-off events. For 404710/410476 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 369776 event pairs, 3103 based on Foata normal form. 784/35197 useless extension candidates. Maximal degree in co-relation 214584. Up to 19568 conditions per place. [2025-02-06 09:35:54,818 INFO L140 encePairwiseOnDemand]: 74/100 looper letters, 1140 selfloop transitions, 1349 changer transitions 1/2544 dead transitions. [2025-02-06 09:35:54,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 2544 transitions, 55547 flow [2025-02-06 09:35:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 09:35:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 09:35:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1168 transitions. [2025-02-06 09:35:54,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584 [2025-02-06 09:35:54,820 INFO L175 Difference]: Start difference. First operand has 252 places, 2090 transitions, 41803 flow. Second operand 20 states and 1168 transitions. [2025-02-06 09:35:54,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 2544 transitions, 55547 flow [2025-02-06 09:35:57,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 2544 transitions, 54560 flow, removed 366 selfloop flow, removed 14 redundant places. [2025-02-06 09:35:57,156 INFO L231 Difference]: Finished difference. Result has 262 places, 2411 transitions, 52697 flow [2025-02-06 09:35:57,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=40934, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2090, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1069, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=52697, PETRI_PLACES=262, PETRI_TRANSITIONS=2411} [2025-02-06 09:35:57,158 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 160 predicate places. [2025-02-06 09:35:57,158 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 2411 transitions, 52697 flow [2025-02-06 09:35:57,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.095238095238095) internal successors, (1031), 21 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:35:57,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:57,159 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:35:57,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:35:57,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:57,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:35:57,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -924463131, now seen corresponding path program 6 times [2025-02-06 09:35:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874136919] [2025-02-06 09:35:57,364 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:35:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:57,375 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:35:57,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:57,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 09:35:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874136919] [2025-02-06 09:35:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874136919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:35:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598213577] [2025-02-06 09:35:57,987 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:35:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:57,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:57,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:35:57,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:35:58,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 3 equivalence classes. [2025-02-06 09:35:58,117 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:35:58,117 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-06 09:35:58,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:58,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:35:58,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:35:58,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:35:58,173 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:35:58,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 09:35:58,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 09:35:58,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:35:58,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:58,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:35:58,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:58,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:35:58,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-02-06 09:35:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:35:58,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:35:58,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)))) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:35:58,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~arg.base v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:35:58,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)))))) is different from false [2025-02-06 09:35:58,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)))) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:35:58,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 2)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2))) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_505 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_505) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse3 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:36:04,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:04,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-02-06 09:36:04,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:04,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2025-02-06 09:36:04,700 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:04,704 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:04,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:04,709 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:04,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598213577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:04,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 13] total 32 [2025-02-06 09:36:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313282919] [2025-02-06 09:36:04,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 09:36:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:04,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 09:36:04,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=653, Unknown=17, NotChecked=280, Total=1056 [2025-02-06 09:36:04,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 100 [2025-02-06 09:36:04,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 2411 transitions, 52697 flow. Second operand has 33 states, 33 states have (on average 38.42424242424242) internal successors, (1268), 33 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:04,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:04,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 100 [2025-02-06 09:36:04,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:36:17,987 INFO L124 PetriNetUnfolderBase]: 17708/38143 cut-off events. [2025-02-06 09:36:17,988 INFO L125 PetriNetUnfolderBase]: For 472765/480210 co-relation queries the response was YES. [2025-02-06 09:36:18,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237337 conditions, 38143 events. 17708/38143 cut-off events. For 472765/480210 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 394912 event pairs, 3704 based on Foata normal form. 1076/37395 useless extension candidates. Maximal degree in co-relation 234780. Up to 23028 conditions per place. [2025-02-06 09:36:18,688 INFO L140 encePairwiseOnDemand]: 69/100 looper letters, 1569 selfloop transitions, 980 changer transitions 0/2592 dead transitions. [2025-02-06 09:36:18,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 2592 transitions, 61122 flow [2025-02-06 09:36:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:36:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:36:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 984 transitions. [2025-02-06 09:36:18,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44727272727272727 [2025-02-06 09:36:18,690 INFO L175 Difference]: Start difference. First operand has 262 places, 2411 transitions, 52697 flow. Second operand 22 states and 984 transitions. [2025-02-06 09:36:18,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 2592 transitions, 61122 flow [2025-02-06 09:36:21,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 2592 transitions, 60352 flow, removed 353 selfloop flow, removed 12 redundant places. [2025-02-06 09:36:21,417 INFO L231 Difference]: Finished difference. Result has 278 places, 2525 transitions, 58763 flow [2025-02-06 09:36:21,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=51931, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=866, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=58763, PETRI_PLACES=278, PETRI_TRANSITIONS=2525} [2025-02-06 09:36:21,419 INFO L279 CegarLoopForPetriNet]: 102 programPoint places, 176 predicate places. [2025-02-06 09:36:21,419 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 2525 transitions, 58763 flow [2025-02-06 09:36:21,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 38.42424242424242) internal successors, (1268), 33 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:21,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:36:21,420 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:36:21,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:36:21,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 09:36:21,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 09:36:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:36:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -625834113, now seen corresponding path program 7 times [2025-02-06 09:36:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:36:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797901192] [2025-02-06 09:36:21,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:36:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:36:21,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:36:21,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:21,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:36:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797901192] [2025-02-06 09:36:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797901192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:36:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457539436] [2025-02-06 09:36:21,858 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:36:21,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:36:21,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:36:21,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:36:21,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 09:36:21,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:36:21,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:36:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:36:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:36:21,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 09:36:21,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:36:21,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 09:36:21,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 09:36:21,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 09:36:21,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 09:36:21,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-06 09:36:21,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:21,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-06 09:36:22,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:22,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-06 09:36:22,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-02-06 09:36:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:22,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:36:22,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 2)))) (forall ((v_ArrVal_568 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1)))) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2025-02-06 09:36:22,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:36:22,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 1)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 2)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_568) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2025-02-06 09:36:22,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:22,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-02-06 09:36:22,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:36:22,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2025-02-06 09:36:22,275 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:22,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-02-06 09:36:22,279 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:22,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:22,282 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-06 09:36:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-06 09:36:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:36:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457539436] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:36:22,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:36:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2025-02-06 09:36:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133890176] [2025-02-06 09:36:22,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:36:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:36:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:36:22,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:36:22,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=263, Unknown=32, NotChecked=108, Total=462 [2025-02-06 09:36:22,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-02-06 09:36:22,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 2525 transitions, 58763 flow. Second operand has 22 states, 22 states have (on average 49.04545454545455) internal successors, (1079), 22 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:36:22,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:36:22,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-02-06 09:36:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand